Sciweavers

3433 search results - page 344 / 687
» Heuristics for a bidding problem
Sort
View
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 8 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
ASIACRYPT
2008
Springer
15 years 8 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
FPL
2008
Springer
126views Hardware» more  FPL 2008»
15 years 8 months ago
Customized Reconfigurable Interconnection Networks for multiple application SOCS
A Customized Reconfigurable Interconnection Network (CRIN) refers to a minimal switching network, yielding routing solutions for any element in a pre-given set of routing requirem...
Hongbing Fan, Jason Ernst, Yu-Liang Wu
AAAI
2004
15 years 8 months ago
Stochastic Local Search for POMDP Controllers
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
Darius Braziunas, Craig Boutilier
EGITALY
2006
15 years 8 months ago
Color Palette Images Re-indexing by Self Organizing Motor Maps
Palette re-ordering is a well known and very effective approach for improving the compression of color-indexed images. If the spatial distribution of the indexes in the image is s...
Sebastiano Battiato, Francesco Rundo, Filippo Stan...