12519 search results - page 110 / 2504 » Approximation Problems Categories |
188
click to vote
ESA
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
164
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
142
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Evolutionary Computations in dynamic/uncertain environments have attracted much attention. Studies regarding this research subjects can be classified into four categories: Noise, ...
245
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This paper investig...
225
click to vote
PODS
2011
ACM
14 years 9 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...