6274 search results - page 512 / 1255 » From query complexity to computational complexity |
148
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
This paper presents patterns of cooperative interaction derived from ethnographic studies of cooperative work as devices for generalisation, re-use and design. These patterns cons...
169
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
196
click to vote
ASIACRYPT
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...
210
click to vote
HIPC
2005
Springer
16 years 16 days ago
2005
Springer
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...
148
click to vote
ICCS
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...