Sciweavers

2489 search results - page 233 / 498
» On the Subgroup Distance Problem
Sort
View
PPSN
2010
Springer
15 years 2 months ago
Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
Tamara Ulrich, Johannes Bader, Lothar Thiele
ICCV
2005
IEEE
16 years 6 months ago
A Robust Algorithm for Point Set Registration Using Mixture of Gaussians
This paper proposes a novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented...
Bing Jian, Baba C. Vemuri
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 5 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
15 years 11 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
144
Voted
IJCNN
2008
IEEE
15 years 11 months ago
Support vector machines and dynamic time warping for time series
— Effective use of support vector machines (SVMs) in classification necessitates the appropriate choice of a kernel. Designing problem specific kernels involves the definition...
Steinn Gudmundsson, Thomas Philip Runarsson, Sven ...