5 search results - page 1 / 1 » Optimal Implicit Dictionaries over Unbounded Universes |
160
Voted
MST
2006
15 years 7 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
187
Voted
ICALP
2003
Springer
16 years 18 days ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
220
Voted
ACSD
2007
IEEE
15 years 9 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
251
click to vote
ICIP
2006
IEEE
16 years 9 months ago
2006
IEEE
In this paper we describe the ongoing work on a new paradigm for compressing the motion predicted error in a video coder, referred to as MMP-Video. This new coding algorithm uses ...
193
Voted
ITSL
2008
15 years 8 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...