Sciweavers

124 search results - page 14 / 25
» Constraint-Based Optimal Testing Using DNNF Graphs
Sort
View
TOC
2008
122views more  TOC 2008»
14 years 9 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
PROCEDIA
2010
344views more  PROCEDIA 2010»
14 years 7 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz
ENTCS
2002
181views more  ENTCS 2002»
14 years 9 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
IJCV
2006
299views more  IJCV 2006»
14 years 9 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
SC
1990
ACM
15 years 1 months ago
Loop distribution with arbitrary control flow
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...
Ken Kennedy, Kathryn S. McKinley