Sciweavers

1457 search results - page 39 / 292
» On the Uniform Distribution of Strings
Sort
View
SPAA
2000
ACM
15 years 9 months ago
Generalized connection caching
Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where the establishment...
Susanne Albers
PPSN
1994
Springer
15 years 10 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
Günter Rudolph
ALT
2005
Springer
16 years 2 months ago
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
Nick Palmer, Paul W. Goldberg
ORDER
2010
110views more  ORDER 2010»
15 years 4 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
PCM
2007
Springer
136views Multimedia» more  PCM 2007»
15 years 12 months ago
Laplacian Distortion Model (LDM) for Rate Control in Video Coding
Abstract. In many rate control models, a uniform weighted distortion has been assumed; that is, the DCT coefficients of the motioncompensation difference frames (residues) conform...
Long Xu, Xiangyang Ji, Wen Gao, Debin Zhao