736 search results - page 102 / 148 » A dynamic data structure for approximate range searching |
134
Voted
ESOP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
136
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
230
click to vote
ICDE
2003
IEEE
16 years 4 months ago
2003
IEEE
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
141
Voted
CLOUD
2010
ACM
15 years 8 months ago
2010
ACM
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
140
Voted
HEURISTICS
2008
15 years 2 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...