Sciweavers

1241 search results - page 170 / 249
» Path-oriented random testing
Sort
View
KDD
2009
ACM
140views Data Mining» more  KDD 2009»
16 years 13 days ago
Improving clustering stability with combinatorial MRFs
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
Ron Bekkerman, Martin Scholz, Krishnamurthy Viswan...
ECCV
2008
Springer
15 years 10 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
CRV
2009
IEEE
237views Robotics» more  CRV 2009»
15 years 6 months ago
SEC: Stochastic Ensemble Consensus Approach to Unsupervised SAR Sea-Ice Segmentation
The use of synthetic aperture radar (SAR) has become an integral part of sea-ice monitoring and analysis in the polar regions. An important task in sea-ice analysis is to segment ...
Alexander Wong, David A. Clausi, Paul W. Fieguth
CIKM
2009
Springer
15 years 6 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 6 months ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor