Sciweavers

1089 search results - page 32 / 218
» Randomness and Reducibility
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
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...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ECAL
2003
Springer
14 years 29 days ago
Critical Values in Asynchronous Random Boolean Networks
Abstract Wherever we see life, we see different kinds of complex networks, reason why they are studied across various fields of science. Random Boolean Networks (RBNs) form a spe...
Bertrand Mesot, Christof Teuscher
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 9 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
EMNLP
2006
13 years 9 months ago
A Hybrid Markov/Semi-Markov Conditional Random Field for Sequence Segmentation
Markov order-1 conditional random fields (CRFs) and semi-Markov CRFs are two popular models for sequence segmentation and labeling. Both models have advantages in terms of the typ...
Galen Andrew
ET
2002
84views more  ET 2002»
13 years 7 months ago
Hardware Generation of Random Single Input Change Test Sequences
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
René David, Patrick Girard, Christian Landr...