Sciweavers

666 search results - page 51 / 134
» The Pipelined Set Cover Problem
Sort
View
PARA
1995
Springer
14 years 1 months ago
A Proposal for a Set of Parallel Basic Linear Algebra Subprograms
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS. The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
Jaeyoung Choi, Jack Dongarra, Susan Ostrouchov, An...
CIVR
2009
Springer
583views Image Analysis» more  CIVR 2009»
14 years 10 months ago
Mining from Large Image Sets
So far, most image mining was based on interactive querying. Although such querying will remain important in the future, several applications need image mining at such wide scale...
Luc J. Van Gool, Michael D. Breitenstein, Stephan ...
CONCUR
2007
Springer
14 years 2 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
IPCO
2001
117views Optimization» more  IPCO 2001»
13 years 11 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
JSA
2000
175views more  JSA 2000»
13 years 10 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd