Sciweavers

129 search results - page 24 / 26
» The Parameterized Complexity of the Minimum Shared Edges Pro...
Sort
View
CGF
2005
94views more  CGF 2005»
14 years 9 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
ICC
2011
IEEE
201views Communications» more  ICC 2011»
13 years 9 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
84
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 9 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
EMSOFT
2004
Springer
15 years 2 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
CP
2009
Springer
15 years 10 months ago
Same-Relation Constraints
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
Christopher Jefferson, Karen E. Petrie, Meinolf Se...