Sciweavers

299 search results - page 23 / 60
» On Graph Query Optimization in Large Networks
Sort
View
UAI
2003
15 years 3 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
IPPS
2008
IEEE
15 years 8 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
IPPS
1998
IEEE
15 years 6 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
IWMMDBMS
1998
139views more  IWMMDBMS 1998»
15 years 3 months ago
Fusion of Multimedia Information
: In recent years the fusion of multimedia information from multiple real-time sources and databases has become increasingly important because of its practical significance in many...
Shi-Kuo Chang, Taieb Znati
BIBE
2007
IEEE
145views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
Qiong Cheng, Robert W. Harrison, Alexander Zelikov...