Sciweavers

275 search results - page 30 / 55
» Component factors with large components in graphs
Sort
View
190
Voted
JSAT
2008
122views more  JSAT 2008»
15 years 6 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 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...
177
Voted
BIOCOMP
2008
15 years 7 months ago
Prediction of Protein Function Using Graph Container and Message Passing
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
Hongbo Zhou, Qiang Shawn Cheng, Mehdi Zargham
ICDE
2010
IEEE
322views Database» more  ICDE 2010»
16 years 5 months ago
XML-Based Computation for Scientific Workflows
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Bertram Ludäscher, Daniel Zinn, Shawn Bowers
ICCD
2000
IEEE
75views Hardware» more  ICCD 2000»
16 years 3 months ago
Hybridizing and Coalescing Load Value Predictors
Most well-performing load value predictors are hybrids that combine multiple predictors into one. Such hybrids are often large. To reduce their size and to improve their performan...
Martin Burtscher, Benjamin G. Zorn