Sciweavers

685 search results - page 80 / 137
» Succinct Trees in Practice
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
SOCO
2008
Springer
13 years 7 months ago
Superimposition: A Language-Independent Approach to Software Composition
Superimposition is a composition technique that has been applied successfully in several areas of software development. In order to unify several languages and tools that rely on s...
Sven Apel, Christian Lengauer
FOCM
2010
143views more  FOCM 2010»
13 years 6 months ago
Algebraic Structures of B-series
B-series are a fundamental tool in practical and theoretical aspects of numerical integrators for ordinary differential equations. A composition law for B-series permits an elega...
Philippe Chartier, Ernst Hairer, Gilles Vilmart
ECCV
2002
Springer
14 years 9 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 7 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...