1291 search results - page 68 / 259 » Computing the multiplicity structure in solving polynomial s... |
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
CCGRID
2002
IEEE
14 years 21 days ago
2002
IEEE
This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific dataset...
ICCS
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
ASIC provides more than an order of magnitude advantage in terms of density, speed, and power requirement per gate. However, economic (cost of masks) and technological (deep micro...
VL
1991
IEEE
13 years 11 months ago
1991
IEEE
The Conceptual Programming environment, CP, being developed at the Computing Research Laboratory (CRL), is a complete knowledge representation visual programming environment for u...