Sciweavers

298 search results - page 24 / 60
» Measuring Linearity of Ordered Point Sets
Sort
View
BMVC
2010
14 years 7 months ago
Sparse Sparse Bundle Adjustment
Sparse Bundle Adjustment (SBA) is a method for simultaneously optimizing a set of camera poses and visible points. It exploits the sparse primary structure of the problem, where c...
Kurt Konolige
COMPGEOM
2005
ACM
14 years 11 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
JORS
2010
134views more  JORS 2010»
14 years 4 months ago
An overview and framework for PD backtesting and benchmarking
In order to manage model risk, financial institutions need to set up validation processes so as to monitor the quality of the models on an ongoing basis. Validation can be conside...
G. Castermans, David Martens, Tony Van Gestel, B. ...
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
15 years 10 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
NIPS
1997
14 years 10 months ago
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
Joshua B. Tenenbaum