Sciweavers

1332 search results - page 158 / 267
» Combinatorial Algorithms
Sort
View
PAMI
2006
440views more  PAMI 2006»
13 years 9 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
BMCBI
2010
108views more  BMCBI 2010»
13 years 9 months ago
A genetic ensemble approach for gene-gene interaction identification
Background: It has now become clear that gene-gene interactions and gene-environment interactions are ubiquitous and fundamental mechanisms for the development of complex diseases...
Pengyi Yang, Joshua W. K. Ho, Albert Y. Zomaya, Bi...
AAAI
2007
13 years 11 months ago
Data Structures for Generalised Arc Consistency for Extensional Constraints
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 9 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
ECML
2006
Springer
13 years 11 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev