1709 search results - page 95 / 342 » Comparing the Performance of Database Selection Algorithms |
151
Voted
PLDI
1995
ACM
15 years 8 months ago
1995
ACM
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
143
click to vote
TSP
2008
15 years 4 months ago
2008
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
134
click to vote
JCM
2008
15 years 5 months ago
2008
In this work a joint clock recovery (CR) and equalization scheme for short burst transmissions is presented. The joint optimization performance may be pursued by means of both data...
154
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In object-oriented or object-relational databases such as multimedia databases or most XML databases, access patterns are not static, i.e., applications do not always acc...
164
click to vote
IPSN
2007
Springer
15 years 11 months ago
2007
Springer
FlashDB is a self-tuning database optimized for sensor networks using NAND flash storage. In practical systems flash is used in different packages such as on-board flash chips,...