Sciweavers

13457 search results - page 7 / 2692
» Can we elect if we cannot compare
Sort
View
ICRA
2009
IEEE
185views Robotics» more  ICRA 2009»
14 years 2 months ago
Ad-hoc wireless network coverage with networked robots that cannot localize
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 7 months ago
Classical Interaction Cannot Replace a Quantum Message
We demonstrate a two-player communication problem that can be solved in the oneway quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communicat...
Dmitry Gavinsky
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
13 years 9 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
MAAMAW
1994
Springer
13 years 11 months ago
What Ants Cannot Do
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
Eric Werner
ECCC
2011
204views ECommerce» more  ECCC 2011»
12 years 11 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman