631 search results - page 72 / 127 » Additive Approximation for Edge-Deletion Problems |
135
Voted
ICDE
2010
IEEE
15 years 2 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
130
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
121
Voted
ALENEX
2009
15 years 16 days ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
158
Voted
TSP
2012
13 years 10 months ago
2012
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
104
Voted
ICIP
1998
IEEE
16 years 4 months ago
1998
IEEE
This paper describes e cient and optimal encoding and representation of object contours. Contours are approximated by connected second-order spline segments, each de ned by three ...