273 search results - page 53 / 55 » Improving the Efficiency of Memory Partitioning by Address C... |
101
click to vote
ALGORITHMICA
2000
14 years 9 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
99
Voted
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
115
click to vote
ECCV
2008
Springer
15 years 7 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
DCC
1995
IEEE
15 years 1 months ago
1995
IEEE
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...
168
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...