Sciweavers

2200 search results - page 152 / 440
» Bloch's Constant is Computable
Sort
View
ICALP
2009
Springer
16 years 1 months ago
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
Abstract. We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of...
Rachid Guerraoui, Eric Ruppert
STACS
2009
Springer
16 years 1 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay
ICPR
2008
IEEE
16 years 28 days ago
Improvement on Mean Shift based tracking using second-order information
Object tracking based on Mean Shift (MS) algorithm has been very successful and thus receives significant research interests. Unfortunately, traditional MS based tracking only ut...
Lijuan Xiao, Peihua Li
EUC
2005
Springer
16 years 21 hour ago
ANTS: An Evolvable Network of Tiny Sensors
As a promising technology that enables ubiquitous computing and leads IT industries of next generation, sensor networks (SN) are foreseen to expand and populate the globe in such a...
Daeyoung Kim, Tomás López, Seongeun ...
FCT
2005
Springer
16 years 19 hour ago
The Complexity of Semilinear Problems in Succinct Representation
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
Peter Bürgisser, Felipe Cucker, Paulin Jacob&...