Sciweavers

267 search results - page 28 / 54
» The Distribution Family of Similarity Distances
Sort
View
PDCN
2004
13 years 9 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
CSDA
2010
108views more  CSDA 2010»
13 years 7 months ago
Assessing when a sample is mostly normal
The use of trimming procedures constitutes a natural approach to robustifying statistical methods. This is the case of goodness-of-fit tests based on a distance, which can be modi...
Pedro C. Alvarez-Esteban, Eustasio del Barrio, Jua...
CAD
2004
Springer
13 years 7 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...
UAI
2004
13 years 9 months ago
Dependent Dirichlet Priors and Optimal Linear Estimators for Belief Net Parameters
A Bayesian belief network is a model of a joint distribution over a finite set of variables, with a DAG structure representing immediate dependencies among the variables. For each...
Peter Hooper
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...