5606 search results - page 197 / 1122 » Randomization Techniques for Graphs. |
94
Voted
DM
2008
15 years 24 days ago
2008
We give new examples of graphs with the n-e.c. adjacency property. Few explicit families of n-e.c. graphs are known, despite the fact that almost all finite graphs are n-e.c. Our ...
126
Voted
ICARIS
2005
Springer
15 years 6 months ago
2005
Springer
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
110
Voted
DFT
2003
IEEE
15 years 6 months ago
2003
IEEE
Transient faults in VLSI circuits could lead to disastrous consequences. With technology scaling, circuits are becoming increasingly vulnerable to transient faults. This papers pr...
120
Voted
CVPR
2006
IEEE
16 years 2 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...
134
click to vote
ICASSP
2007
IEEE
15 years 7 months 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...