Sciweavers

564 search results - page 61 / 113
» Error-tolerant Tree Matching
Sort
View
IUI
2009
ACM
15 years 8 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
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...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...
INFOCOM
2000
IEEE
15 years 4 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
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...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 11 months ago
The Quantum Black-Box Complexity of Majority
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...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
BMCBI
2007
119views more  BMCBI 2007»
15 years 7 hour ago
A dynamic programming approach for the alignment of signal peaks in multiple gas chromatography-mass spectrometry experiments
Background: Gas chromatography-mass spectrometry (GC-MS) is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples ...
Mark D. Robinson, David P. De Souza, Woon Wai Keen...
CVPR
2010
IEEE
15 years 8 months ago
Linked Edges as Stable Region Boundaries
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...
Michael Donoser, Hayko Riemenschneider and Horst B...