Sciweavers

8669 search results - page 100 / 1734
» Computing matrix representations
Sort
View
IMCSIT
2010
13 years 6 months ago
Parallel, Massive Processing in SuperMatrix - a General Tool for Distributional Semantic Analysis of Corpus
The paper presents an extended version of the SuperMatrix system -- a general tool supporting automatic acquisition of lexical semantic relations from corpora. Extensions focus mai...
Bartosz Broda, Damian Jaworski, Maciej Piasecki
ICIP
2006
IEEE
14 years 10 months ago
Fast Construction of Covariance Matrices for Arbitrary Size Image Windows
We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator ...
Fatih Porikli, Oncel Tuzel
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 9 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
PDP
2010
IEEE
14 years 4 months ago
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
Bora Ucar, Ümit V. Çatalyürek
BMVC
2001
13 years 11 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock