Sciweavers

16404 search results - page 372 / 3281
» A set coverage problem
Sort
View
JAMDS
2002
155views more  JAMDS 2002»
15 years 5 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
ICCV
2007
IEEE
16 years 8 months ago
Mixture-of-Parts Pictorial Structures for Objects with Variable Part Sets
For many multi-part object classes, the set of parts can vary not only in location but also in type. For example, player formations in American football involve various subsets of...
Robin Hess, Alan Fern, Eric N. Mortensen
ISBI
2008
IEEE
16 years 6 months ago
Controlling the error in FMRI: Hypothesis testing or set estimation?
This paper describes a new methodology and associated theoretical analysis for rapid and accurate extraction of activation regions from functional MRI data. Most fMRI data analysi...
Aarti Singh, Rebecca Willett, Robert Nowak, Zachar...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 10 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ICPP
2000
IEEE
15 years 10 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary