Sciweavers

2487 search results - page 440 / 498
» Partitions of Graphs into Trees
Sort
View
EUROPAR
1998
Springer
14 years 9 days ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
SIGGRAPH
1994
ACM
14 years 4 days ago
IRIS performer: a high performance multiprocessing toolkit for real-time 3D graphics
This paper describes the design and implementation of IRIS Performer, a toolkit for visual simulation, virtual reality, and other real-time 3D graphics applications. The principal...
John Rohlf, James Helman
CP
2007
Springer
14 years 14 hour ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
FOCS
2000
IEEE
13 years 11 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
VISUAL
2000
Springer
13 years 11 months ago
Statistical Motion-Based Retrieval with Partial Query
We present an original approach for motion-based retrieval involving partial query. More precisely, we propose an uni ed statistical framework both to extract entities of interest ...
Ronan Fablet, Patrick Bouthemy