6274 search results - page 1037 / 1255 » From query complexity to computational complexity |
170
click to vote
WABI
2005
Springer
15 years 11 months ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
165
click to vote
CSCW
2004
ACM
15 years 11 months ago
2004
ACM
This paper considers the complexity of measuring the return on investment for technology adoption. A brief case study of technology adoption in a large design and construction fir...
155
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
149
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
141
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...