Sciweavers

4865 search results - page 446 / 973
» The Complexity of Graph Connectivity
Sort
View
BIODATAMINING
2008
119views more  BIODATAMINING 2008»
15 years 7 months ago
A survey of visualization tools for biological network analysis
The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount ...
Georgios A. Pavlopoulos, Anna-Lynn Wegener, Reinha...
IJES
2006
72views more  IJES 2006»
15 years 6 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan
PAMI
2006
440views more  PAMI 2006»
15 years 6 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
JCT
2007
85views more  JCT 2007»
15 years 6 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
JMLR
2011
133views more  JMLR 2011»
15 years 1 months ago
Operator Norm Convergence of Spectral Clustering on Level Sets
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
Bruno Pelletier, Pierre Pudlo