Sciweavers

Share
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
8 years 28 days ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...
STACS
2012
Springer
8 years 6 months ago
Linear-Space Data Structures for Range Mode Query in Arrays
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
Timothy M. Chan, Stephane Durocher, Kasper Green L...
EMNLP
2011
8 years 10 months ago
Compositional Matrix-Space Models for Sentiment Analysis
We present a general learning-based approach for phrase-level sentiment analysis that adopts an ordinal sentiment scale and is explicitly compositional in nature. Thus, we can mod...
Ainur Yessenalina, Claire Cardie
ASAP
2011
IEEE
228views Hardware» more  ASAP 2011»
8 years 10 months ago
A high-performance, low-power linear algebra core
—Achieving high-performance while reducing power consumption is a key concern as technology scaling is reaching its limits. It is well-accepted that application-specific custom ...
Ardavan Pedram, Andreas Gerstlauer, Robert A. van ...
COMPGEOM
2011
ACM
9 years 2 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
CCGRID
2011
IEEE
9 years 2 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
TEC
2010
184views more  TEC 2010»
9 years 5 months ago
Automatic Reproduction of a Genius Algorithm: Strassen's Algorithm Revisited by Genetic Search
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
Seunghyun Oh, Byung-Ro Moon
FOCS
2010
IEEE
9 years 8 months ago
Replacement Paths via Fast Matrix Multiplication
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
Oren Weimann, Raphael Yuster
TPDS
2002
94views more  TPDS 2002»
9 years 10 months ago
Recursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
PC
2002
158views Management» more  PC 2002»
9 years 10 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch
books