Results 1  10
of
23,194
Maximum skewsymmetric flows and matchings
 MATHEMATICAL PROGRAMMING
, 2004
"... The maximum integer skewsymmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of selfconjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical r ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The maximum integer skewsymmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of selfconjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical
Maximum SkewSymmetric Flows
 PROCEEDINGS OF THE 3RD ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS
, 1995
"... We introduce the maximum skewsymmetric flow problem which generalizes flow and matching problems. We develop a theory of skewsymmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We introduce the maximum skewsymmetric flow problem which generalizes flow and matching problems. We develop a theory of skewsymmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skewsymmetric
Maximum SkewSymmetric Flows and Their Applications to BMatchings
, 1999
"... We introduce the maximum integer skewsymmetric flow problem (MSFP) which generalizes both the maximum flow and maximum matching problems. We establish analogs of the classical flow decomposition, augmenting path, and maxflow mincut theorems for skewsymmetric flows. These theoretical results are t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We introduce the maximum integer skewsymmetric flow problem (MSFP) which generalizes both the maximum flow and maximum matching problems. We establish analogs of the classical flow decomposition, augmenting path, and maxflow mincut theorems for skewsymmetric flows. These theoretical results
Path Problems In SkewSymmetric Graphs
, 1993
"... . We study path problems in skewsymmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skewsymmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
. We study path problems in skewsymmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skewsymmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive
Image registration methods: a survey
 IMAGE AND VISION COMPUTING
, 2003
"... This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align t ..."
Abstract

Cited by 738 (9 self)
 Add to MetaCart
two images (the reference and sensed images). The reviewed approaches are classified according to their nature (areabased and featurebased) and according to four basic steps of image registration procedure: feature detection, feature matching, mapping function design, and image transformation
Query evaluation techniques for large databases
 ACM COMPUTING SURVEYS
, 1993
"... Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of objectoriented and extensible database systems will not solve this problem. On ..."
Abstract

Cited by 762 (11 self)
 Add to MetaCart
relational database systems, including iterative execution of complex query evaluation plans, the duality of sort and hashbased set matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.
Measurement and Analysis of Online Social Networks
 In Proceedings of the 5th ACM/USENIX Internet Measurement Conference (IMCâ€™07
, 2007
"... Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity ..."
Abstract

Cited by 688 (15 self)
 Add to MetaCart
and 328 million links. We believe that this is the first study to examine multiple online social networks at scale. Our results confirm the powerlaw, smallworld, and scalefree properties of online social networks. We observe that the indegree of user nodes tends to match the outdegree; that the networks
By Force of Habit: A ConsumptionBased Explanation of Aggregate Stock Market Behavior
, 1999
"... We present a consumptionbased model that explains a wide variety of dynamic asset pricing phenomena, including the procyclical variation of stock prices, the longhorizon predictability of excess stock returns, and the countercyclical variation of stock market volatility. The model captures much of ..."
Abstract

Cited by 1429 (68 self)
 Add to MetaCart
We present a consumptionbased model that explains a wide variety of dynamic asset pricing phenomena, including the procyclical variation of stock prices, the longhorizon predictability of excess stock returns, and the countercyclical variation of stock market volatility. The model captures much of the history of stock prices from consumption data. It explains the short and longrun equity premium puzzles despite a low and constant riskfree rate. The results are essentially the same whether we model stocks as a claim to the consumption stream or as a claim to volatile dividends poorly correlated with consumption. The model is driven by an independently and identically distributed consumption growth process and adds a slowmoving external habit to the standard power utility function. These features generate slow countercyclical variation in risk premia. The model posits a fundamentally novel description of risk premia: Investors fear stocks primarily because they do poorly in recessions unrelated to the risks of longrun average consumption growth.
Results 1  10
of
23,194