Sciweavers

1084 search results - page 97 / 217
» Optimal worm-scanning method using vulnerable-host distribut...
Sort
View
147
Voted
IEICET
2007
90views more  IEICET 2007»
15 years 3 months ago
Multi-Point Simulated Annealing with Adaptive Neighborhood
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
Keiko Ando, Mitsunori Miki, Tomoyuki Hiroyasu
ICIP
2010
IEEE
15 years 2 months ago
Total subset variation prior
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
Sanjeev Kumar, Truong Q. Nguyen
MICCAI
2006
Springer
16 years 5 months ago
Shape-Driven 3D Segmentation Using Spherical Wavelets
Abstract. This paper presents a novel active surface segmentation algorithm using a multiscale shape representation and prior. We define a parametric model of a surface using spher...
Delphine Nain, Steven Haker, Aaron F. Bobick, Alle...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 4 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
AAAI
2008
15 years 6 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings