Sciweavers

760 search results - page 91 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
DISOPT
2010
129views more  DISOPT 2010»
13 years 9 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
IJRR
2008
98views more  IJRR 2008»
13 years 8 months ago
Automatic Configuration Recognition Methods in Modular Robots
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
Michael Park, Sachin Chitta, Alex Teichman, Mark Y...
JMLR
2010
113views more  JMLR 2010»
13 years 3 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 9 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
SIGIR
2008
ACM
13 years 8 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero