Sciweavers

895 search results - page 56 / 179
» Using graphs for some discrete tomography problems
Sort
View
JCO
1998
136views more  JCO 1998»
13 years 10 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
13 years 10 months ago
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
Brett Stevens
ANOR
2008
66views more  ANOR 2008»
13 years 11 months ago
Optimization problems involving collections of dependent objects
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
CVPR
2006
IEEE
15 years 29 days ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
13 years 9 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer