Sciweavers

905 search results - page 123 / 181
» On the Complexity of uSPR Distance
Sort
View
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 3 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
MM
2005
ACM
139views Multimedia» more  MM 2005»
15 years 3 months ago
Exploiting self-adaptive posture-based focus estimation for lecture video editing
Head pose plays a special role in estimating a presenter’s focuses and actions for lecture video editing. This paper presents an efficient and robust head pose estimation algori...
Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
15 years 3 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
PERVASIVE
2005
Springer
15 years 3 months ago
A Conceptual Framework for Camera Phone-Based Interaction Techniques
This paper proposes and evaluates interaction techniques for camera-equipped mobile phones. The proposed techniques are based on a visual code system that provides a number of orie...
Michael Rohs, Philipp Zweifel
COMPGEOM
2004
ACM
15 years 3 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...