Sciweavers

9842 search results - page 1743 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 4 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 4 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
OSDI
2004
ACM
16 years 4 months ago
Using Magpie for Request Extraction and Workload Modelling
Tools to understand complex system behaviour are essential for many performance analysis and debugging tasks, yet there are many open research problems in their development. Magpi...
Paul Barham, Austin Donnelly, Rebecca Isaacs, Rich...
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
16 years 4 months ago
Efficient lineage tracking for scientific workflows
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
Thomas Heinis, Gustavo Alonso
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 4 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
« Prev « First page 1743 / 1969 Last » Next »