Sciweavers

5022 search results - page 493 / 1005
» Data structures and problem solving using Java
Sort
View
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 9 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
PAMI
1998
197views more  PAMI 1998»
15 years 4 months ago
Inference of Integrated Surface, Curve, and Junction Descriptions From Sparse 3D Data
—We are interested in descriptions of 3D data sets, as obtained from stereo or a 3D digitizer. We therefore consider as input a sparse set of points, possibly associated with cer...
Chi-Keung Tang, Gérard G. Medioni
TIP
2010
113views more  TIP 2010»
14 years 11 months ago
Multiplicative Noise Removal Using Variable Splitting and Constrained Optimization
Multiplicative noise (also known as speckle noise) models are central to the study of coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser...
José M. Bioucas-Dias, Mário A. T. Fi...
CVPR
2004
IEEE
16 years 6 months ago
2D-Shape Analysis Using Conformal Mapping
The study of 2D shapes and their similarities is a central problem in the field of vision. It arises in particular from the task of classifying and recognizing objects from their ...
Eitan Sharon, David Mumford
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 5 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...