Sciweavers

1391 search results - page 221 / 279
» Optimally Sparse Frames
Sort
View
ICCSA
2003
Springer
15 years 11 months ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
15 years 11 months ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
SIGGRAPH
2010
ACM
15 years 10 months ago
SmartBoxes for interactive urban reconstruction
We introduce an interactive tool which enables a user to quickly assemble an architectural model directly over a 3D point cloud acquired from large-scale scanning of an urban scen...
Liangliang Nan, Andrei Sharf, Hao Zhang, Daniel Co...
IPPS
1999
IEEE
15 years 10 months ago
A Novel Compilation Framework for Supporting Semi-Regular Distributions in Hybrid Applications
This paper explains how efficient support for semiregular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work ...
Dhruva R. Chakrabarti, Prithviraj Banerjee
EMMCVPR
1997
Springer
15 years 10 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann