2095 search results - page 134 / 419 » Improved pebbling bounds |
139
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
156
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...
165
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
167
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
173
click to vote
AMT
2006
Springer
15 years 8 months ago
2006
Springer
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...