Sciweavers

5138 search results - page 338 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CEC
2010
IEEE
14 years 10 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
JMLR
2010
115views more  JMLR 2010»
15 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
ICIP
2008
IEEE
16 years 1 months ago
MAP-MRF approach for binarization of degraded document image
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
Jung Gap Kuk, Nam Ik Cho, Kyoung Mu Lee
MOBIHOC
2012
ACM
13 years 9 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
INFOCOM
2005
IEEE
16 years 7 days ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic