90 search results - page 15 / 18 » On approximating complex quadratic optimization problems via... |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
ICARCV
2008
IEEE
14 years 2 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
NIPS
2007
13 years 9 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...