146 search results - page 21 / 30 » Local distance functions: A taxonomy, new algorithms, and an... |
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
RECOMB
2001
Springer
14 years 16 hour ago
2001
Springer
High-throughput, data-directed computational protocols for Structural Genomics (or Proteomics) are required in order to evaluate the protein products of genes for structure and fu...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
HUMO
2007
Springer
14 years 1 months ago
2007
Springer
We present a method to simultaneously estimate 3d body pose and action categories from monocular video sequences. Our approach learns a lowdimensional embedding of the pose manifol...
BMCBI
2011
12 years 11 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...