580 search results - page 36 / 116 » Approximation Algorithms for Temporal Reasoning |
123
click to vote
TCS
2010
15 years 24 days ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
129
click to vote
GIS
2002
ACM
15 years 2 months ago
2002
ACM
This paper contributes a general approach to characterizing patterns of change in a spatio-temporal database. While there is a particular interest in modelling and querying how sp...
142
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
141
click to vote
CALC
2001
Springer
15 years 7 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
63
Voted
WSC
2004
15 years 3 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...