Sciweavers

510 search results - page 34 / 102
» Adaptive Distances on Sets of Vectors
Sort
View
152
Voted
CSDA
2007
100views more  CSDA 2007»
15 years 6 months ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
16 years 6 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
ICIP
2002
IEEE
16 years 7 months ago
Optimal recursive similarity measure estimation for interactive content-based image retrieval
In this paper, a new recursive algorithm is proposed for optimal estimation of similarity measure used in a content-based retrieval system. This is performed through a relevance f...
Anastasios D. Doulamis, Nikolaos D. Doulamis
ICPR
2002
IEEE
15 years 11 months ago
A Fast Narrow Band Method and Its Application in Topology-Adaptive 3-D Modeling
We present a new fast method of modeling 3-D objects of arbitrary topology. The Level Set Methods have been used by many researchers to recover 3-D shapes of arbitrary topology. H...
Shuntaro Yui, Kenji Hara, Hongbin Zha, Tsutomu Has...
JCO
2010
123views more  JCO 2010»
15 years 4 months ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher