Sciweavers

5606 search results - page 143 / 1122
» Randomization Techniques for Graphs.
Sort
View
DM
2011
264views Education» more  DM 2011»
13 years 5 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
15 years 3 days ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
ICSE
2007
IEEE-ACM
14 years 10 months ago
Parallel Randomized State-Space Search
Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major advances in reduction and optimization techniques, s...
Matthew B. Dwyer, Sebastian G. Elbaum, Suzette Per...
ICC
2007
IEEE
117views Communications» more  ICC 2007»
14 years 5 months ago
Radio Channel Modelling Using Stochastic Propagation Graphs
Abstract— In this contribution the radio channel model proposed in [1] is extended to include multiple transmitters and receivers. The propagation environment is modelled using r...
Troels Pedersen, Bernard H. Fleury
PARA
2004
Springer
14 years 4 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...