10146 search results - page 324 / 2030 » Fast FAST |
158
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
123
click to vote
OSDI
2004
ACM
16 years 5 months ago
2004
ACM
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
207
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
250
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...