2313 search results - page 303 / 463 » On Heuristic Time Hierarchies |
182
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
274
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Tuple dropping, though commonly used for load shedding in most stream operations, is inadequate for m-way, windowed stream joins. The join output rate can be overly reduced becaus...
141
click to vote
SCHEDULING
2008
15 years 6 months ago
2008
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
254
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
161
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...