Sciweavers

2403 search results - page 229 / 481
» Optimal Randomized RANSAC
Sort
View
EDBT
2004
ACM
131views Database» more  EDBT 2004»
16 years 3 months ago
Declustering Two-Dimensional Datasets over MEMS-Based Storage
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
Hailing Yu, Divyakant Agrawal, Amr El Abbadi
ACSAC
2009
IEEE
15 years 10 months ago
Symmetric Cryptography in Javascript
—We take a systematic approach to developing a symmetric cryptography library in Javascript. We study various strategies for optimizing the code for the Javascript interpreter, a...
Emily Stark, Michael Hamburg, Dan Boneh
FSTTCS
2004
Springer
15 years 9 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
GECCO
2003
Springer
109views Optimization» more  GECCO 2003»
15 years 9 months ago
Real Royal Road Functions for Constant Population Size
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
Tobias Storch, Ingo Wegener
ECAI
2010
Springer
15 years 4 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng