Sciweavers

25 search results - page 5 / 5
» Approximation algorithms via contraction decomposition
Sort
View
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 6 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
CORR
2010
Springer
209views Education» more  CORR 2010»
13 years 3 months ago
Generalized Tree-Based Wavelet Transform
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
Idan Ram, Michael Elad, Israel Cohen
VLDB
2001
ACM
139views Database» more  VLDB 2001»
13 years 10 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
ECCV
2002
Springer
14 years 8 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
INFOCOM
2007
IEEE
14 years 21 days ago
Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
Junhua Zhu, Shan Chen, Brahim Bensaou, Ka-Lok Hung