Sciweavers

56 search results - page 5 / 12
» O-Convexity Computing Hulls Approximations and Orientation S...
Sort
View
CCCG
2009
13 years 8 months ago
On Directed Graphs with an Upward Straight-line
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
FMSD
2006
104views more  FMSD 2006»
13 years 7 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
HYBRID
2009
Springer
14 years 2 months ago
Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems
ion of discrete abstractions of arbitrary memory span for nonlinear sampled systems Gunther Reißig⋆ Technische Universit¨at Berlin, Fakult¨at Elektrotechnik und Informatik, He...
Gunther Reißig
CVPR
2010
IEEE
13 years 10 months ago
Integrated Pedestrian Classification and Orientation Estimation
This paper presents a novel approach to single-frame pedestrian classification and orientation estimation. Unlike previous work which addressed classification and orientation sepa...
Markus Enzweiler, Dariu Gavrila
ISWC
2003
IEEE
14 years 19 days ago
Coarse, Inexpensive, Infrared Tracking for Wearable Computing
We present a novel, inexpensive, coarse tracking system that determines a person’s approximate 2D location and 1D head orientation in an indoor environment. While this coarse tr...
Drexel Hallaway, Tobias Höllerer, Steven Fein...