Sciweavers

206 search results - page 10 / 42
» New Data Structures for Subgraph Connectivity
Sort
View
BMCBI
2005
125views more  BMCBI 2005»
13 years 7 months ago
Query3d: a new method for high-throughput analysis of functional residues in protein structures
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...
Gabriele Ausiello, Allegra Via, Manuela Helmer-Cit...
SBBD
2001
119views Database» more  SBBD 2001»
13 years 9 months ago
The Dimension-Join: A New Index for Data Warehouses
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
Pedro Bizarro, Henrique Madeira
IPPS
2009
IEEE
14 years 2 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 16 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
ICML
2003
IEEE
14 years 8 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...