Sciweavers

5169 search results - page 811 / 1034
» Locality approximation using time
Sort
View
DICTA
2003
15 years 6 months ago
A Hough Based Eye Direction Detection Algorithm without On-site Calibration
  This paper proposes an algorithm to estimate gaze direction  without on-site calibration even when the position of the head relative to  the camera moves...
Takeshi Takegami, Toshiyuki Gotoh, Seiichiro Kagei...
SIROCCO
1997
15 years 6 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
WSCG
2000
93views more  WSCG 2000»
15 years 6 months ago
Real-time Animation Technique for Flexible and Thin Objects
In this paper, we propose an e cient technique for the animation of exible thin objects. Massspring model was employed to represent the exible objects. Many techniques have used t...
Young-Min Kang, Jeong-Hyeon Choi, Hwan-Gue Cho, Do...
CIDR
2009
157views Algorithms» more  CIDR 2009»
15 years 5 months ago
Capturing Data Uncertainty in High-Volume Stream Processing
We present the design and development of a data stream system that captures data uncertainty from data collection to query processing to final result generation. Our system focuse...
Yanlei Diao, Boduo Li, Anna Liu, Liping Peng, Char...
ECAI
2010
Springer
15 years 5 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert