Sciweavers

97 search results - page 13 / 20
» Approximate center points with proofs
Sort
View
CF
2005
ACM
13 years 9 months ago
Marching-pixels: a new organic computing paradigm for smart sensor processor arrays
In this paper we present a new organic computing principle denoted as marching pixels for the architectures of future smart CMOS camera chips. The idea of marching pixels is based...
Dietmar Fey, Daniel Schmidt 0003
SENSYS
2003
ACM
14 years 26 days ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...
FOCS
1989
IEEE
13 years 11 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 7 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 8 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani