3415 search results - page 330 / 683 » Lower bounds on kernelization |
198
click to vote
SECON
2007
IEEE
16 years 1 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
165
click to vote
WEA
2007
Springer
16 years 25 days ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
180
click to vote
ADC
2006
Springer
16 years 22 days ago
2006
Springer
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
166
click to vote
ICTCS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
162
click to vote
COCO
2004
Springer
16 years 4 days ago
2004
Springer
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...