Sciweavers

154 search results - page 12 / 31
» Clos Solutions to Binary Methods
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 3 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
CVPR
2012
IEEE
11 years 11 months ago
Icon scanning: Towards next generation QR codes
Undoubtedly, a key feature in the popularity of smartmobile devices is the numerous applications one can install. Frequently, we learn about an application we desire by seeing it ...
Itamar Friedman, Lihi Zelnik-Manor
JCP
2006
90views more  JCP 2006»
13 years 8 months ago
Using LDA Method to Provide Mobile Location Estimation Services within a Cellular Radio Network
Abstract-- Mobile location estimation is becoming an important value-added service for a mobile phone operator. It is well-known that GPS can provide an accurate location estimatio...
Junyang Zhou, Joseph Kee-Yin Ng
EPIA
2009
Springer
14 years 3 months ago
Colored Nonograms: An Integer Linear Programming Approach
Abstract. In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black a...
Luís Mingote, Francisco Azevedo
CEC
2010
IEEE
13 years 9 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius