Sciweavers

941 search results - page 29 / 189
» Efficient Testing of Large Graphs
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
RECOMB
2007
Springer
15 years 10 months ago
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
Srinath Sridhar, Satish Rao, Eran Halperin
CN
2010
121views more  CN 2010»
14 years 6 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
VLDB
1994
ACM
115views Database» more  VLDB 1994»
15 years 1 months ago
Database Graph Views: A Practical Model to Manage Persistent Graphs
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
Alejandro Gutiérrez, Philippe Pucheral, Her...
EH
2000
IEEE
123views Hardware» more  EH 2000»
15 years 2 months ago
The Test Vector Problem and Limitations to Evolving Digital Circuits
How do we know the correctness of an evolved circuit? While Evolutionary Hardware is exhibiting its effectiveness, we argue that it is very difficult to design a large-scale digit...
Kosuke Imamura, James A. Foster, Axel W. Krings