Sciweavers

860 search results - page 66 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
MST
2010
117views more  MST 2010»
13 years 6 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 3 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
ICPR
2008
IEEE
14 years 2 months ago
A uniformity criterion and algorithm for data clustering
We propose a novel multivariate uniformity criterion for testing uniformity of point density in an arbitrary dimensional point pattern . An unsupervised, nonparametric data cluste...
Sanketh Shetty, Narendra Ahuja
IPMI
2005
Springer
14 years 1 months ago
Fundamental Limits in 3D Landmark Localization
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
Karl Rohr
IJCNN
2006
IEEE
14 years 1 months ago
Particle Swarm Optimization of Fuzzy ARTMAP Parameters
— In this paper a Particle Swarm Optimization (PSO)-based training strategy is introduced for fuzzy ARTMAP that minimizes generalization error while optimizing parameter values. ...
Eric Granger, Philippe Henniges, Luiz S. Oliveira,...