Sciweavers

3678 search results - page 535 / 736
» On the Stable Paths Problem
Sort
View
TOG
2002
108views more  TOG 2002»
15 years 4 months ago
Motion graphs
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
Lucas Kovar, Michael Gleicher, Frederic H. Pighin
TSMC
2002
110views more  TSMC 2002»
15 years 4 months ago
Bio-mimetic trajectory generation of robots via artificial potential field with time base generator
This paper proposes a new trajectory generation method that allows full control of transient behavior, namely, time-to-target and velocity profile, based on the artificial potentia...
Toshio Tsuji, Yoshiyuki Tanaka, Pietro Morasso, Vi...
TON
2008
120views more  TON 2008»
15 years 3 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
INFOCOM
2010
IEEE
15 years 2 months ago
Towards a Theory of Anonymous Networking
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
Javad Ghaderi, Rayadurgam Srikant
ESA
2010
Springer
188views Algorithms» more  ESA 2010»
15 years 2 months ago
Contractions of Planar Graphs in Polynomial Time
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
Marcin Kaminski, Daniël Paulusma, Dimitrios M...