Sciweavers

19866 search results - page 257 / 3974
» Computing all factorizations in ***
Sort
View
IPPS
2003
IEEE
15 years 12 months ago
Parallel Direct Solution of Linear Equations on FPGA-Based Machines
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...
Xiaofang Wang, Sotirios G. Ziavras
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 7 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
FOCS
1991
IEEE
15 years 10 months ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
FLAIRS
2008
15 years 9 months ago
Planning for Welfare to Work
We are interested in building decision-support software for social welfare case managers. Our model in the form of a factored Markov decision process is so complex that a standard...
Liangrong Yi, Raphael A. Finkel, Judy Goldsmith
WDAG
2001
Springer
122views Algorithms» more  WDAG 2001»
15 years 11 months ago
Computation Slicing: Techniques and Theory
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
Neeraj Mittal, Vijay K. Garg