Sciweavers

567 search results - page 32 / 114
» Distance Learning for Similarity Estimation
Sort
View
COLT
1995
Springer
13 years 11 months ago
A Comparison of New and Old Algorithms for a Mixture Estimation Problem
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
David P. Helmbold, Yoram Singer, Robert E. Schapir...
IVC
2010
128views more  IVC 2010»
13 years 6 months ago
Online kernel density estimation for interactive learning
In this paper we propose a Gaussian-kernel-based online kernel density estimation which can be used for applications of online probability density estimation and online learning. ...
Matej Kristan, Danijel Skocaj, Ales Leonardis
APVIS
2009
13 years 8 months ago
Visualizing time-varying features with TAC-based distance fields
To analyze time-varying data sets, tracking features over time is often necessary to better understand the dynamic nature of the underlying physical process. Tracking 3D time-vary...
Teng-Yok Lee, Han-Wei Shen
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
14 years 1 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
BMCBI
2006
137views more  BMCBI 2006»
13 years 7 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...