29908 search results - page 378 / 5982 » On the Complexity of |
213
click to vote
TCS
2008
15 years 6 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
179
click to vote
TCS
2008
15 years 6 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
176
click to vote
CC
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
177
click to vote
TSI
2008
15 years 6 months ago
2008
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
137
click to vote
TSP
2008
15 years 6 months ago
2008
High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...