Sciweavers

281 search results - page 55 / 57
» The Proof Complexity of Linear Algebra
Sort
View
90
Voted
COMGEO
2007
ACM
14 years 9 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
WMPI
2004
ACM
15 years 3 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 2 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
TPDS
2008
124views more  TPDS 2008»
14 years 9 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
JZUSC
2010
129views more  JZUSC 2010»
14 years 8 months ago
Representing conics by low degree rational DP curves
: A DP curve is a new kind of parametric curve defined by Delgado and Peña (2003); it has very good properties when used in both geometry and algebra, i.e., it is shape preserving...
Qian-qian Hu, Guo-jin Wang