4377 search results - page 564 / 876 » Mass problems and randomness |
166
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
210
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
165
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
192
click to vote
PDPTA
2004
15 years 8 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
180
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...