558 search results - page 60 / 112 » Trees and Matchings |
105
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
114
click to vote
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
111
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
IUI
2009
ACM
15 years 8 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
ALGORITHMICA
2002
14 years 11 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...