Sciweavers

451 search results - page 66 / 91
» Simulated Annealing for Convex Optimization
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Approximation of salient contours in cluttered scenes
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Rui Huang, Nong Sang, Qiling Tang
ICDM
2007
IEEE
139views Data Mining» more  ICDM 2007»
14 years 4 months ago
Data Clustering with a Relational Push-Pull Model
We present a new generative model for relational data in which relations between objects can have either a binding or a separating effect. For example, in a group of students sep...
Adam Anthony, Marie desJardins
IPPS
2007
IEEE
14 years 4 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
14 years 3 months ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn
3DPVT
2006
IEEE
224views Visualization» more  3DPVT 2006»
14 years 3 months ago
A Bayesian Approach to Building Footprint Extraction from Aerial LIDAR Data
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are ofte...
Oliver Wang, Suresh K. Lodha, David P. Helmbold