Sciweavers

425 search results - page 14 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
84
Voted
SENSYS
2005
ACM
15 years 3 months ago
Estimating clock uncertainty for efficient duty-cycling in sensor networks
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
Saurabh Ganeriwal, Deepak Ganesan, Hohyun Shim, Vl...
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
14 years 10 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
DAC
2006
ACM
15 years 10 months ago
Leakage power reduction of embedded memories on FPGAs through location assignment
Transistor leakage is poised to become the dominant source of power dissipation in digital systems, and reconfigurable devices are not immune to this problem. Modern FPGAs already...
Yan Meng, Timothy Sherwood, Ryan Kastner
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 6 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ICGI
2010
Springer
14 years 10 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik