2107 search results - page 118 / 422 » Computing Small Search Numbers in Linear Time |
101
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
153
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Time series prediction is an important issue in a wide range of areas. There are various real world processes whose states vary continuously, and those processes may have influenc...
163
Voted
KES
2006
Springer
15 years 3 months ago
2006
Springer
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
122
Voted
DAM
2006
15 years 3 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
112
Voted
ALENEX
2003
15 years 4 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...