699 search results - page 57 / 140 » Generalized Distance Functions in the Theory of Computation |
117
click to vote
SMI
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we introduce a parallel numerical scheme, the lattice Boltzmann method, to shape modeling applications. The motivation of using this originally-designed fluid dyna...
PR
2007
14 years 9 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
TYPES
2007
Springer
15 years 3 months ago
2007
Springer
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are no...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
117
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
This paper proposes a very general max-margin learning framework for distance-based clustering. To this end, it formulates clustering as a high order energy minimization problem w...