683 search results - page 72 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
196
click to vote
BICOB
2010
Springer
15 years 12 months ago
2010
Springer
Molecular dynamics simulations have been employed by biologists to study the protein folding problem. Such simulations have resulted in a large number of protein folding trajector...
192
Voted
COLT
2004
Springer
15 years 11 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
174
click to vote
INFOCOM
2005
IEEE
16 years 22 days ago
2005
IEEE
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
217
click to vote
JOT
2007
15 years 7 months ago
2007
This paper describes how to extract stock quote data and display it with a dynamic update (using free, but delayed data streams). As a part of the architecture of the program, we ...
198
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...