Sciweavers

2004 search results - page 200 / 401
» Sampling from large graphs
Sort
View
116
Voted
WSDM
2010
ACM
254views Data Mining» more  WSDM 2010»
16 years 27 days ago
Learning Influence Probabilities In Social Networks
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
Amit Goyal 0002, Francesco Bonchi, Laks V. S. Laks...
FTRTFT
1998
Springer
15 years 7 months ago
A Modular Visual Model for Hybrid Systems
Visual description techniques are particularly important for the design of hybrid systems because specifications of such systems must usually be discussed between engineers from a ...
Radu Grosu, Thomas Stauner, Manfred Broy
132
Voted
WEBI
2007
Springer
15 years 9 months ago
Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...
Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B...
230
Voted
ICPP
2006
IEEE
15 years 9 months ago
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
Robert Niewiadomski, José Nelson Amaral, Ro...
130
Voted
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
15 years 8 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek