STOC

2012

ACM

11 years 5 months ago
2012

ACM

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...

STACS

2012

Springer

11 years 10 months ago
2012

Springer

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...

EMNLP

2011

12 years 2 months ago
2011

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...

ASAP

2011

IEEE

12 years 2 months ago
2011

IEEE

—Achieving high-performance while reducing power consumption is a key concern as technology scaling is reaching its limits. It is well-accepted that application-speciﬁc custom ...

COMPGEOM

2011

ACM

12 years 6 months ago
2011

ACM

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...

CCGRID

2011

IEEE

12 years 6 months ago
2011

IEEE

– 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 ...

TEC

2010

12 years 9 months ago
2010

Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n

FOCS

2010

IEEE

13 years 25 days ago
2010

IEEE

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...

TPDS

2002

13 years 2 months ago
2002

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...

PC

2002

13 years 2 months ago
2002

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...