Sciweavers

5100 search results - page 101 / 1020
» The Linear Complexity of a Graph
Sort
View
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
13 years 7 months ago
CET: A Tool for Creative Exploration of Graphs
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
Stefan Haun, Andreas Nürnberger, Tobias K&oum...
RTA
2010
Springer
14 years 1 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang
ICCV
1999
IEEE
14 years 10 months ago
Curve Finder Combining Perceptual Grouping and a Kalman Like Fitting
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
Frederic Guichard, Jean-Philippe Tarel
AAAI
2006
13 years 10 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar