Sciweavers

226 search results - page 29 / 46
» Tuning experiments with an adaptive computational framework
Sort
View
ICCS
2005
Springer
14 years 1 months ago
Vectorized Sparse Matrix Multiply for Compressed Row Storage Format
Abstract. The innovation of this work is a simple vectorizable algorithm for performing sparse matrix vector multiply in compressed sparse row (CSR) storage format. Unlike the vect...
Eduardo F. D'Azevedo, Mark R. Fahey, Richard Tran ...
EMNLP
2007
13 years 9 months ago
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...
ECCV
2006
Springer
14 years 9 months ago
Unsupervised Texture Segmentation with Nonparametric Neighborhood Statistics
Abstract. This paper presents a novel approach to unsupervised texture segmentation that relies on a very general nonparametric statistical model of image neighborhoods. The method...
Suyash P. Awate, Tolga Tasdizen, Ross T. Whitaker
ICCV
2009
IEEE
13 years 5 months ago
SURF Tracking
Most motion-based tracking algorithms assume that objects undergo rigid motion, which is most likely disobeyed in real world. In this paper, we present a novel motionbased trackin...
Wei He, Takayoshi Yamashita, Hongtao Lu, Shihong L...
IPPS
1999
IEEE
13 years 12 months ago
Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parall...
Rupak Biswas, Leonid Oliker, Sajal K. Das, Daniel ...