Sciweavers

1375 search results - page 205 / 275
» Matching Points with Things
Sort
View
122
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
TRIDENTCOM
2005
IEEE
15 years 6 months ago
Wireless Link SNR Mapping Onto An Indoor Testbed
To facilitate a broad range of experimental research on novel protocols and application concepts, we employ an indoor wireless testbed to emulate the performance of the real-world...
Jing Lei, Roy D. Yates, Larry J. Greenstein, Hang ...
119
Voted
ICN
2005
Springer
15 years 6 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
SIGIR
1998
ACM
15 years 4 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
DGCI
2009
Springer
15 years 3 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso