4198 search results - page 156 / 840 » In search of lost time |
170
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
167
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
165
click to vote
ICTIR
2009
Springer
16 years 1 months ago
2009
Springer
We address the problem of online term recurrence prediction: for a stream of terms, at each time point predict what term is going to recur next in the stream given the term occurre...
198
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
152
click to vote
ICDE
2007
IEEE
16 years 25 days ago
2007
IEEE
The search for unknown frequent pattern is one of the core activities in many time series data mining processes. In this paper we present an extension of the pattern discovery pro...