1022 search results - page 30 / 205 » Logspace Complexity of Functions and Structures |
129
click to vote
KI
2007
Springer
15 years 3 months ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
123
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
128
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
131
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...
111
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...