Sciweavers

738 search results - page 117 / 148
» Exploiting Locality in Searching the Web
Sort
View
ECCV
2010
Springer
15 years 5 months ago
Towards Optimal Naive Bayes Nearest Neighbor
Abstract. Naive Bayes Nearest Neighbor (NBNN) is a feature-based image classifier that achieves impressive degree of accuracy [1] by exploiting ‘Image-toClass’ distances and b...
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 3 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
ICIP
2003
IEEE
16 years 1 months ago
Unsupervised statistical sketching for non-photorealistic rendering models
This paper investigates the use of the Bayesian inference for devising an unsupervised sketch rendering procedure. As likelihood model of this inference, we exploit the recent sta...
Max Mignotte
CVPR
2010
IEEE
15 years 8 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
15 years 6 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...