Sciweavers

3875 search results - page 283 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
IPSN
2007
Springer
16 years 27 days ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
CORR
2007
Springer
89views Education» more  CORR 2007»
15 years 6 months ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier
174
Voted
ICML
2004
IEEE
16 years 7 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
AAAI
1997
15 years 8 months ago
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
Frank Klassner, Victor R. Lesser, Hamid Nawab
CISS
2008
IEEE
16 years 1 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell