620 search results - page 87 / 124 » The edge-flipping group of a graph |
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
ACCV
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...