Sciweavers

221 search results - page 1 / 45
» The cost of not knowing the radius
Sort
View
SMA
2008
ACM
122views Solid Modeling» more  SMA 2008»
13 years 7 months ago
The cost of not knowing the radius
Robust Statistics considers the quality of statistical decisions in the presence of deviations from the ideal model, where deviations are modelled by neighborhoods of a certain siz...
Helmut Rieder, Matthias Kohl, Peter Ruckdeschel
SPIRE
2009
Springer
14 years 2 months ago
Consensus Optimizing Both Distance Sum and Radius
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...
Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin...
STOC
1995
ACM
89views Algorithms» more  STOC 1995»
13 years 11 months ago
What do we know about the Metropolis algorithm?
Persi Diaconis, Laurent Saloff-Coste
ICIP
2006
IEEE
14 years 9 months ago
Low Cost Robust Blur Estimator
A novel local blur estimation method is presented in the paper. Focal blur process is usually modeled as a Gaussian low-pass filtering and then the problem of blur estimation is t...
Hao Hu, Gerard de Haan
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 28 days ago
The Multi-radius Cover Problem
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
Refael Hassin, Danny Segev