Sciweavers

94 search results - page 16 / 19
» Capacity inverse minimum cost flow problem
Sort
View
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 27 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
CGF
2005
94views more  CGF 2005»
13 years 7 months ago
Morphology-independent representation of motions for interactive human-like animation
This paper addresses the problem of human motion encoding for real-time animation in interactive environments. Classically, a motion is stored as a sequence of body postures encod...
Richard Kulpa, Franck Multon, Bruno Arnaldi
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 7 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
EUSFLAT
2007
107views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
Extending the Choquet integral
In decision under uncertainty, the Choquet integral yields the expectation of a random variable with respect to a fuzzy measure (or non-additive probability or capacity). In gener...
Giovanni Rossi
COMCOM
2008
143views more  COMCOM 2008»
13 years 7 months ago
Cross-layer rate control, medium access control and routing design in cooperative VANET
In this paper, we address the rate control, the Medium Access Control (MAC) and the routing problem for cooperative Vehicular Ad-Hoc Network (VANET) in the framework of cross-laye...
Liang Zhou, Baoyu Zheng, Benoit Geller, Anne Wei, ...