Sciweavers

1068 search results - page 36 / 214
» Factorization as a Rank 1 Problem
Sort
View
BNCOD
2006
55views Database» more  BNCOD 2006»
14 years 11 months ago
On the Optimal Ordering of Maps, Selections, and Joins Under Factorization
We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions i...
Thomas Neumann, Sven Helmer, Guido Moerkotte
FOCS
2004
IEEE
15 years 1 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
15 years 10 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
SC
1995
ACM
15 years 1 months ago
Parallel Implementations of the Power System Transient Stability Problem on Clusters of Workstations
Power system transient stability analysis computes the response of the rapidly changing electrical components of a power system to a sequence of large disturbances followed by ope...
Monika ten Bruggencate, Suresh Chalasani
DLT
2008
14 years 11 months ago
On the Relation between Periodicity and Unbordered Factors of Finite Words
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equ...
Stepan Holub, Dirk Nowotka