2095 search results - page 151 / 419 » Improved pebbling bounds |
148
click to vote
SIROCCO
2007
15 years 8 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
183
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
197
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
158
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
183
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the gri...