Sciweavers

481 search results - page 61 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
STACS
2009
Springer
14 years 3 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
TARK
2009
Springer
14 years 3 months ago
Rationality and the speed of decision-making
ity and the speed of decision-making (extended abstract) Michael Mandler Department of Economics Royal Holloway College, University of London Egham, Surrey TW20 0EX United Kingdom ...
Michael Mandler
ROBOCOMM
2007
IEEE
14 years 3 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
JOC
2006
71views more  JOC 2006»
13 years 8 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...
FIW
2003
115views Communications» more  FIW 2003»
13 years 10 months ago
Generalising Feature Interactions in Email
We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall’s email model [12] presented at FIW’00 [3]...
Muffy Calder, Alice Miller