Sciweavers

13603 search results - page 219 / 2721
» On the Complexity of Computing Treelength
Sort
View
136
Voted
COMPGEOM
2008
ACM
15 years 6 months ago
Delpsc: a delaunay mesher for piecewise smooth complexes
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
Tamal K. Dey, Joshua A. Levine
ECCV
2008
Springer
15 years 5 months ago
Multi-thread Parsing for Recognizing Complex Events in Videos
This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...
Zhang Zhang, Kaiqi Huang, Tieniu Tan
JC
2008
92views more  JC 2008»
15 years 4 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier
ICCV
2009
IEEE
1136views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Robust Graph-Cut Scene Segmentation and Reconstruction for Free-Viewpoint Video of Complex Dynamic Scenes
Current state-of-the-art image-based scene reconstruction techniques are capable of generating high-fidelity 3D models when used under controlled capture conditions. However, th...
Jean-Yves Guillemaut, Joe Kilner and Adrian Hilton
163
Voted
WG
2009
Springer
15 years 11 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj