3270 search results - page 296 / 654 » Approximate String Processing |
121
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
149
Voted
ISAAC
2000
Springer
15 years 7 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
139
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
117
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
178
Voted
DCOSS
2008
Springer
15 years 5 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...