3946 search results - page 727 / 790 » The computational complexity of choice sets |
176
click to vote
ALGOSENSORS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
211
click to vote
IPSN
2007
Springer
16 years 16 days ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
157
click to vote
PKC
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
167
click to vote
FOCS
2006
IEEE
16 years 13 days ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
186
click to vote
ICAC
2006
IEEE
16 years 13 days ago
2006
IEEE
— Recent advances have demonstrated the potential benefits of coordinated management of thermal load in data centers, including reduced cooling costs and improved resistance to ...