Sciweavers

2922 search results - page 194 / 585
» Scalable Algorithms for Distribution Search
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 9 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
174
Voted
ADHOCNOW
2007
Springer
15 years 10 months ago
Dependable and Secure Distributed Storage System for Ad Hoc Networks
The increased use of ubiquitous computing devices is resulting in networks that are highly mobile, well connected and growing in processing and storage capabilities. The nature of ...
Rudi Ball, James Grant, Jonathan So, Victoria Spur...
SIGCOMM
2004
ACM
15 years 9 months ago
Delayed stability and performance of distributed congestion control
Recent research efforts to design better Internet transport protocols combined with scalable Active Queue Management (AQM) have led to significant advances in congestion control...
Yueping Zhang, Seong-ryong Kang, Dmitri Loguinov
IPPS
2000
IEEE
15 years 8 months ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar