Sciweavers

958 search results - page 91 / 192
» Resolving the Micropayment Problem
Sort
View
FOCS
2007
IEEE
15 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 2 days ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
CVPR
2008
IEEE
16 years 2 days ago
Joint tracking of features and edges
Sparse features have traditionally been tracked from frame to frame independently of one another. We propose a framework in which features are tracked jointly. Combining ideas fro...
Stanley T. Birchfield, Shrinivas J. Pundlik
ECCV
2008
Springer
15 years 12 months ago
Beyond Nouns: Exploiting Prepositions and Comparative Adjectives for Learning Visual Classifiers
Learning visual classifiers for object recognition from weakly labeled data requires determining correspondence between image regions and semantic object classes. Most approaches u...
Abhinav Gupta, Larry S. Davis
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
15 years 11 months ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...