Sciweavers

5022 search results - page 145 / 1005
» Data structures and problem solving using Java
Sort
View
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
14 years 11 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
CORR
2011
Springer
146views Education» more  CORR 2011»
14 years 1 months ago
Use of Devolved Controllers in Data Center Networks
—In a data center network, for example, it is quite often to use controllers to manage resources in a centralized manner. Centralized control, however, imposes a scalability prob...
Adrian Sai-Wah Tam, Kang Xi, H. Jonathan Chao
ECML
2006
Springer
15 years 1 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
WWW
2009
ACM
15 years 10 months ago
Incorporating site-level knowledge to extract structured data from web forums
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
Jiang-Ming Yang, Rui Cai, Yida Wang, Jun Zhu, Lei ...
SPAA
1990
ACM
15 years 2 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter