Sciweavers

779 search results - page 113 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
15 years 10 months ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao
ICVS
2003
Springer
15 years 9 months ago
Automatic Mapping of Settlement Areas Using a Knowledge-Based Image Interpretation System
Abstract. We introduce the knowledge-based image interpretation system GeoAIDA and give examples for an image operator, extracting trees from aerial imagery. Moreover we present a ...
Bernd-Michael Straub, Markus Gerke, Martin Pahl
DATE
1998
IEEE
82views Hardware» more  DATE 1998»
15 years 8 months ago
Exploiting Symbolic Techniques for Partial Scan Flip Flop Selection
Partial Scan techniques have been widely accepted as an effective solution to improve sequential ATPG performance while keeping acceptable area and performance overheads. Several ...
Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda,...
IBPRIA
2007
Springer
15 years 6 months ago
Automatic Learning of Conceptual Knowledge in Image Sequences for Human Behavior Interpretation
This work describes an approach for the interpretation and explanation of human behavior in image sequences, within the context of a Cognitive Vision System. The information source...
Pau Baiget, Carles Fernández Tena, F. Xavie...
CCCG
2009
15 years 5 months ago
Approximating Maximum Flow in Polygonal Domains using Spanners
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou