2446 search results - page 329 / 490 » Choiceless Polynomial Time |
STOC
2000
ACM
14 years 9 days ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
ALGOSENSORS
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...