Sciweavers

301 search results - page 40 / 61
» Counting Models Using Connected Components
Sort
View
ESA
2010
Springer
136views Algorithms» more  ESA 2010»
14 years 11 months ago
Fast Minor Testing in Planar Graphs
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...
BMCBI
2005
97views more  BMCBI 2005»
14 years 9 months ago
The yeast kinome displays scale free topology with functional hub clusters
Background: The availability of interaction databases provides an opportunity for researchers to utilize immense amounts of data exclusively in silico. Recently there has been an ...
Robin E. C. Lee, Lynn A. Megeney
RECOMB
2004
Springer
15 years 10 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
FGCS
2007
95views more  FGCS 2007»
14 years 9 months ago
On incorporating differentiated levels of network service into GridSim
Grid computing technologies are increasingly being used to aggregate computing resources that are geographically distributed. Commercial networks are being used to connect these r...
Anthony Sulistio, Gokul Poduval, Rajkumar Buyya, C...
ICPR
2008
IEEE
15 years 4 months ago
A robust front page detection algorithm for large periodical collections
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
Iuliu Vasile Konya, Christoph Seibert, Sebastian G...