Sciweavers

32545 search results - page 761 / 6509
» Data Structures and Algorithms
Sort
View
DASFAA
2007
IEEE
183views Database» more  DASFAA 2007»
16 years 2 months ago
BioDIFF: An Effective Fast Change Detection Algorithm for Biological Annotations
Abstract. Warehousing heterogeneous, dynamic biological data is a key technique for biological data integration as it greatly improves performance. However, it requires complex mai...
Yang Song, Sourav S. Bhowmick, C. Forbes Dewey
GI
2003
Springer
16 years 26 days ago
Link Analysis and Site Structure in Information Retrieval
: Link analysis is the most important application of web structure mining and serves as a new knowledge source in web information retrieval. However, the mono-dimensional analysis ...
Thomas Mandl
PODC
2009
ACM
16 years 2 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
EACL
2009
ACL Anthology
16 years 8 months ago
Parsing Mildly Non-Projective Dependency Structures
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
Carlos Gómez-Rodríguez, David J. Wei...
WWW
2008
ACM
16 years 8 months ago
A framework for fast community extraction of large-scale networks
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
Yutaka I. Leon-Suematsu, Kikuo Yuta