Sciweavers

1629 search results - page 222 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
AIPS
2010
14 years 10 months ago
Iterative Learning of Weighted Rule Sets for Greedy Search
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
Yuehua Xu, Alan Fern, Sung Wook Yoon
CVPR
2010
IEEE
1182views Computer Vision» more  CVPR 2010»
15 years 6 months ago
Real Time Motion Capture using a Single Time-Of-Flight Camera
Markerless tracking of human pose is a hard yet relevant problem. In this paper, we derive an efficient filtering algorithm for tracking human pose at 4-10 frames per second using...
Varun Ganapathi, Christian Plagemann, Sebastian Th...
PVLDB
2008
134views more  PVLDB 2008»
14 years 9 months ago
Reasoning and identifying relevant matches for XML keyword search
Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches t...
Ziyang Liu, Yi Chen
CVPR
2009
IEEE
1528views Computer Vision» more  CVPR 2009»
16 years 2 months ago
Structured Output-Associative Regression
Structured outputs such as multidimensional vectors or graphs are frequently encountered in real world pattern recognition applications such as computer vision, natural language pr...
Liefeng Bo and Cristian Sminchisescu
CAE
2007
15 years 11 days ago
Celtic Knots Colorization based on Color Harmony Principles
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
Caroline Larboulette