Sciweavers

3600 search results - page 359 / 720
» The settling-time reducibility ordering
Sort
View
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
15 years 7 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
MM
2010
ACM
167views Multimedia» more  MM 2010»
15 years 7 months ago
Improving online gaming quality using detour paths
We study the problem of improving the user perceived quality of online games in which multiple players form a game session and exchange game-state updates over an overlay network....
Cong Ly, Cheng-Hsin Hsu, Mohamed Hefeeda
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 6 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
PVLDB
2008
126views more  PVLDB 2008»
15 years 6 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
ASIACRYPT
2010
Springer
15 years 4 months ago
Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
We revisit narrow-pipe designs that are in practical use, and their security against preimage attacks. Our results are the best known preimage attacks on Tiger, MD4, and reduced SH...
Jian Guo, San Ling, Christian Rechberger, Huaxiong...