Sciweavers

3105 search results - page 182 / 621
» The Path-Packing Structure of Graphs
Sort
View
135
Voted
KDD
1995
ACM
106views Data Mining» more  KDD 1995»
15 years 7 months ago
Structured and Unstructured Induction with EDAGs
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
Brian R. Gaines
149
Voted
ICVGIP
2004
15 years 5 months ago
Learning Layered Pictorial Structures from Video
We propose a new unsupervised learning method to obtain a layered pictorial structure (LPS) representation of an articulated object from video sequences. It will be seen that this...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
113
Voted
CVPR
2010
IEEE
15 years 3 months ago
Multi-view structure computation without explicitly estimating motion
Most existing structure-from-motion methods follow a common two-step scheme, where relative camera motions are estimated in the first step and 3D structure is computed afterward ...
Hongdong Li
127
Voted
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 3 months ago
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
Pascal Pons
172
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...