Sciweavers

2463 search results - page 443 / 493
» Rankings of Directed Graphs
Sort
View
TIP
1998
114views more  TIP 1998»
13 years 8 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
TOG
2002
167views more  TOG 2002»
13 years 8 months ago
Interactive control of avatars animated with human motion data
Real-time control of three-dimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, howeve...
Jehee Lee, Jinxiang Chai, Paul S. A. Reitsma, Jess...
RAS
2007
153views more  RAS 2007»
13 years 8 months ago
Cognitive maps for mobile robots - an object based approach
Robots are rapidly evolving from factory work-horses to robot-companions. The future of robots, as our companions, is highly dependent on their abilities to understand, interpret ...
Shrihari Vasudevan, Stefan Gächter, Viet Nguy...
PVLDB
2008
121views more  PVLDB 2008»
13 years 8 months ago
Type inference and type checking for queries on execution traces
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
Daniel Deutch, Tova Milo
JCO
2010
123views more  JCO 2010»
13 years 7 months ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher