Sciweavers

433 search results - page 57 / 87
» A greedy approximation algorithm for the group Steiner probl...
Sort
View
COCOON
2010
Springer
14 years 1 months ago
Tracking a Generator by Persistence
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
Oleksiy Busaryev, Tamal K. Dey, Yusu Wang
ESA
2008
Springer
195views Algorithms» more  ESA 2008»
13 years 10 months ago
A Characterization of 2-Player Mechanisms for Scheduling
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
George Christodoulou, Elias Koutsoupias, Angelina ...
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 10 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 8 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu

Publication
433views
14 years 4 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre