2435 search results - page 137 / 487 » Intellexer Question Answering |
132
Voted
TOC
2010
14 years 10 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
109
Voted
LAWEB
2005
IEEE
15 years 9 months ago
2005
IEEE
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
111
Voted
ASIAN
2005
Springer
15 years 9 months ago
2005
Springer
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
126
Voted
CCR
1999
15 years 3 months ago
1999
Understanding the performance of the Internet's Transmission Control Protocol (TCP) is important because it is the dominant protocol used in the Internet today. Various testi...
102
Voted
LOGCOM
2002
15 years 3 months ago
2002
The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families definable over the real line wi...