3055 search results - page 255 / 611 » Randomized Search Trees |
129
click to vote
IVC
2006
15 years 3 months ago
2006
This paper describes a fully automatic content-based approach for browsing and retrieval of MPEG-2 compressed video. The first step of the approach is the detection of shot bounda...
156
click to vote
SAC
2011
ACM
14 years 6 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
132
click to vote
SSD
2005
Springer
15 years 8 months ago
2005
Springer
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
165
click to vote
PODC
2004
ACM
15 years 8 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
153
Voted
ICS
2009
Tsinghua U.
15 years 7 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...