Sciweavers

772 search results - page 85 / 155
» Hyper-Systolic Matrix Multiplication
Sort
View
111
Voted
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 8 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
114
Voted
TLCA
2007
Springer
15 years 8 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
108
Voted
FOCS
2006
IEEE
15 years 8 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
ICIP
2005
IEEE
15 years 8 months ago
Chromatic adaptation and white-balance problem
The problem of adjusting the color such that the output image from a digital camera, viewed under a standard condition, matches the scene observed by the photographer’s eye is c...
Keigo Hirakawa, Thomas W. Parks
ISPAN
2005
IEEE
15 years 8 months ago
The structure of super line graphs
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...
Jay Bagga, Daniela Ferrero