Sciweavers

1632 search results - page 23 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
131
Voted
JCP
2007
118views more  JCP 2007»
15 years 3 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
ICALP
2005
Springer
15 years 8 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
ICPR
2010
IEEE
15 years 10 months ago
Semi-Supervised Distance Metric Learning by Quadratic Programming
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
Hakan Cevikalp
FOCS
1998
IEEE
15 years 7 months ago
The Finite Capacity Dial-A-Ride Problem
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
Moses Charikar, Balaji Raghavachari
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
15 years 8 months ago
Performance assessment of an artificial immune system multiobjective optimizer by two improved metrics
In this study, we introduce two improved assessment metrics of multiobjective optimizers, Nondominated Ratio and Spacing Distribution, and analyze their rationality and validity. ...
Maoguo Gong, Licheng Jiao, Haifeng Du, Ronghua Sha...