Sciweavers

69 search results - page 5 / 14
» Least Squares Estimation Without Priors or Supervision
Sort
View
CG
2004
Springer
14 years 9 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
INFORMATICALT
1998
126views more  INFORMATICALT 1998»
14 years 9 months ago
On Local Bandwidth Selection for Density Estimation
This article gives ideas for developing statistics software which can work without user intervention. Some popular methods of bandwidth selection for kernel density estimation (the...
Rimantas Rudzkis, Mindaugas Kavaliauskas
CVPR
2011
IEEE
14 years 1 months ago
A fully automated greedy square jigsaw puzzle solver
In the square jigsaw puzzle problem one is required to reconstruct the complete image from a set of non-overlapping, unordered, square puzzle parts. Here we propose a fully automa...
Dolev Pomeranz, Michal Shemesh, Ohad Ben-Shahar
IWANN
2001
Springer
15 years 1 months ago
Learning Adaptive Parameters with Restricted Genetic Optimization Method
Abstract. Mechanisms for adapting models, filters, regulators and so on to changing properties of a system are of fundamental importance in many modern identification, estimation...
Santiago Garrido, Luis Moreno
CN
2007
141views more  CN 2007»
14 years 9 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou