Sciweavers

329 search results - page 28 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
IJAC
2008
97views more  IJAC 2008»
13 years 8 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
IPPS
2009
IEEE
14 years 3 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
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
14 years 9 months ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina
EUROPAR
2007
Springer
14 years 10 days ago
Efficient Parallel Simulation of Large-Scale Neuronal Networks on Clusters of Multiprocessor Computers
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
Hans E. Plesser, Jochen M. Eppler, Abigail Morriso...
WWW
2008
ACM
14 years 9 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...