Sciweavers

2877 search results - page 23 / 576
» The Complexity of Planarity Testing
Sort
View
DARE
2000
108views more  DARE 2000»
13 years 9 months ago
Evaluating navigation methods for an AR system
BUILD-IT is a planning tool based on computer vision technology, supporting complex planning and composition tasks. A group of people, seated around a table, interact with objects...
Morten Fjeld
ECCV
2006
Springer
13 years 11 months ago
Robust Homography Estimation from Planar Contours Based on Convexity
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
Alberto Ruiz, Pedro E. López-de-Teruel, Lor...
DELTA
2010
IEEE
13 years 6 months ago
(Some) Open Problems to Incorporate BIST in Complex Heterogeneous Integrated Systems
This paper presents an overview of test techniques that offer promising features when Built-In-Self-Test (BIST) must be applied to complex intgrated systems including analog, mixed...
Manuel J. Barragan Asian, Gloria Huertas, Adoraci&...
PR
2008
132views more  PR 2008»
13 years 7 months ago
Measuring linearity of planar point sets
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
Milos Stojmenovic, Amiya Nayak, Jovisa D. Zunic
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
13 years 9 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...