Sciweavers

631 search results - page 72 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 10 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
COMPGEOM
2008
ACM
13 years 12 months ago
Maximum thick paths in static and dynamic environments
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...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Rank Aggregation: Together We're Strong
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...
Frans Schalekamp, Anke van Zuylen
TSP
2012
12 years 5 months ago
Sensing and Probing Cardinalities for Active Cognitive Radios
—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...
Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, ...
ICIP
1998
IEEE
14 years 11 months ago
Simultaneous Optimal Boundary Encoding and Variable-Length Code Selection
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 ...
Gerry Melnikov, Guido M. Schuster, Aggelos K. Kats...