Sciweavers

1132 search results - page 197 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
14 years 28 days ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 28 days ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
DCC
2003
IEEE
14 years 21 days ago
Universal Multiple Description Scalar Quantization: Analysis and Design
—This paper introduces a new high-rate analysis of the multiple description scalar quantizer (MDSQ) with balanced descriptions. The analysis provides insight into the structure o...
Chao Tian, Sheila S. Hemami
DBPL
2001
Springer
115views Database» more  DBPL 2001»
13 years 12 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen
FOCS
1999
IEEE
13 years 11 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk