Sciweavers

3145 search results - page 395 / 629
» Algebraic Linear Orderings
Sort
View
PPSC
1993
15 years 7 months ago
Design of a Parallel Nonsymmetric Eigenroutine Toolbox, Part I
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
Zhaojun Bai, James Demmel

Book
34534views
17 years 5 months ago
OpenCV - Open Source Computer Vision Reference Manual
OpenCV is a C/C++ computer vision library originally developed by Intel. It is free for commercial and research use under a BSD license. The library is cross-platform. It is highl...
Intel
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 6 months ago
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design
In this paper, we consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links and single-antenna relay nodes operating under the half-dupl...
K. Sreeram, S. Birenjith, P. Vijay Kumar
DAM
2010
137views more  DAM 2010»
15 years 6 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 6 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama