Sciweavers

1541 search results - page 183 / 309
» From Comparing Clusterings to Combining Clusterings
Sort
View
EOR
2006
118views more  EOR 2006»
15 years 6 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
SIAMSC
2008
192views more  SIAMSC 2008»
15 years 6 months ago
Surface Mesh Smoothing, Regularization, and Feature Detection
We describe a hybrid algorithm that is designed to reconstruct a piecewise smooth surface mesh from noisy input. While denoising, our method simultaneously regularizes triangle me...
Hui Huang, Uri M. Ascher
NC
2007
129views Neural Networks» more  NC 2007»
15 years 6 months ago
Sorting of neural spikes: When wavelet based methods outperform principal component analysis
Sorting of the extracellularly recorded spikes is a basic prerequisite for analysis of the cooperative neural behavior and neural code. Fundamentally the sorting performance is deļ...
Alexey N. Pavlov, Valeri A. Makarov, Ioulia Makaro...
IPPS
2010
IEEE
15 years 4 months ago
Using focused regression for accurate time-constrained scaling of scientific applications
Many large-scale clusters now have hundreds of thousands of processors, and processor counts will be over one million within a few years. Computational scientists must scale their ...
Bradley J. Barnes, Jeonifer Garren, David K. Lowen...
ICIP
2009
IEEE
15 years 4 months ago
An efficient and robust sequential algorithm for background estimation in video surveillance
Many computer vision algorithms such as object tracking and event detection assume that a background model of the scene under analysis is known. However, in many practical circums...
Vikas Reddy, Conrad Sanderson, Brian C. Lovell