Sciweavers

2272 search results - page 13 / 455
» Capture Complexity by Partition
Sort
View
ICPR
2004
IEEE
14 years 9 months ago
Articulate Hand Motion Capturing Based on a Monte Carlo Nelder-Mead Simplex Tracker
This paper presents an algorithm for tracking the articulate hand motion in monocular video sequences. The task is challenging due to the high degrees of freedom involved in the h...
John Lin, Thomas S. Huang, Ying Wu
WWW
2006
ACM
14 years 9 months ago
Capturing RIA concepts in a web modeling language
This work addresses conceptual modeling and automatic code generation for Rich Internet Applications, a variant of Web-based systems bridging the gap between desktop and Web inter...
Alessandro Bozzon, Sara Comai, Piero Fraternali, G...
SEMWEB
2007
Springer
14 years 2 months ago
An Approach to Capture Design-induced Error Using an Ontology
Since engineered systems, e.g. aviation control, have increasingly equipped with automated and computer-supported artifacts, human-system interaction has been an important issue. U...
Injae Shin, Sanghee Kim, Chris A. McMahon
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 9 months ago
Binary space partitions for 3D subdivisions
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
John Hershberger, Subhash Suri
COLOGNETWENTE
2010
13 years 7 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak