Sciweavers

9719 search results - page 180 / 1944
» Answer Set Optimization
Sort
View
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
16 years 6 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...
FSTTCS
2009
Springer
16 years 1 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 11 months ago
Using performance fronts for parameter setting of stochastic metaheuristics
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
Johann Dréo
PAMI
2012
13 years 9 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
ECCV
1998
Springer
16 years 8 months ago
A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...
Raouf Benjemaa, Francis Schmitt