1542 search results - page 146 / 309 » The metamathematics of random graphs |
162
click to vote
SIGIR
2006
ACM
16 years 13 days ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
160
click to vote
IPSN
2005
Springer
16 years 7 hour ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
217
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
189
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
194
click to vote
ICASSP
2007
IEEE
16 years 25 days ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...