Sciweavers

1332 search results - page 157 / 267
» Combinatorial Algorithms
Sort
View
EVOW
2007
Springer
14 years 3 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
IM
2008
13 years 9 months ago
Finding Strongly Knit Clusters in Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
ICCS
2007
Springer
14 years 3 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
RECOMB
2001
Springer
14 years 9 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
ECCV
2004
Springer
14 years 2 months ago
Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
Leo Grady, Gareth Funka-Lea