Sciweavers

2124 search results - page 55 / 425
» An Efficient Framework for Order Optimization
Sort
View
DPD
2006
141views more  DPD 2006»
15 years 4 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
FSE
2003
Springer
243views Cryptology» more  FSE 2003»
15 years 9 months ago
Optimal Key Ranking Procedures in a Statistical Cryptanalysis
Hypothesis tests have been used in the past as a tool in a cryptanalytic context. In this paper, we propose to use this paradigm and define a precise and sound statistical framewo...
Pascal Junod, Serge Vaudenay
ADBIS
2007
Springer
126views Database» more  ADBIS 2007»
15 years 8 months ago
Optimal Query Mapping in Mobile OLAP
Query mapping to aggregation lattices is used in order to exploit sub-cube dependencies in multidimensional databases. It is employed in mobile OLAP dissemination systems, in order...
Ilias Michalarias, Hans-Joachim Lenz
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
15 years 2 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
149
Voted
ICML
2008
IEEE
16 years 5 months ago
Optimizing estimated loss reduction for active sampling in rank learning
Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of insta...
Pinar Donmez, Jaime G. Carbonell