158 search results - page 7 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
235
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
161
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
147
click to vote
EMSOFT
2001
Springer
15 years 10 months ago
2001
Springer
Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, timecritical applications cannot be wr...
136
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...
159
click to vote
COMPGEOM
2006
ACM
16 years 1 days ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...