Sciweavers

1383 search results - page 156 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
ICCV
2003
IEEE
16 years 8 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
ECCV
2004
Springer
16 years 8 months ago
A Unified Algebraic Approach to 2-D and 3-D Motion Segmentation
We present an analytic solution to the problem of estimating multiple 2-D and 3-D motion models from two-view correspondences or optical flow. The key to our approach is to view th...
René Vidal, Yi Ma
RECOMB
2002
Springer
16 years 6 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
16 years 6 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
MOBIHOC
2008
ACM
16 years 6 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp...