Sciweavers

4137 search results - page 739 / 828
» On the number of matchings of a tree
Sort
View
ICPR
2004
IEEE
14 years 9 months ago
Pruning Local Feature Correspondences Using Shape Context
We propose a novel approach to improve the distinctiveness of local image features without significantly affecting their robustness with respect to image deformations. Local image...
Allan D. Jepson, Gustavo Carneiro
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
VLSID
2004
IEEE
209views VLSI» more  VLSID 2004»
14 years 8 months ago
An Architecture for Motion Estimation in the Transform Domain
demanding algorithm of a video encoder. It is known that about 60% ~ 80% of the total computation time is consumed for motion estimation [1]. The second is its high impact on the v...
J. Lee, Narayanan Vijaykrishnan, Mary Jane Irwin, ...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 8 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 8 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah