Results 1  10
of
23,016
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 734 (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
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 1427 (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.
Ariadne: A secure ondemand routing protocol for ad hoc networks
, 2002
"... An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a n ..."
Abstract

Cited by 900 (11 self)
 Add to MetaCart
from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of DenialofService attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such
Results 1  10
of
23,016