Sciweavers

4212 search results - page 343 / 843
» On Compressible Pairings and Their Computation
Sort
View
FOCS
2000
IEEE
16 years 3 days ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
15 years 9 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
CVPR
2004
IEEE
16 years 9 months ago
Learning Distance Functions for Image Retrieval
Image retrieval critically relies on the distance function used to compare a query image to images in the database. We suggest to learn such distance functions by training binary ...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
CVPR
2000
IEEE
16 years 9 months ago
Shape-Based 3D Surface Correspondence Using Geodesics and Local Geometry
This paper describes a new method for determining correspondence between points on pairs of surfaces based on shape using a combination of geodesic distance and surface curvature....
Yongmei Wang, Bradley S. Peterson, Lawrence H. Sta...
ICPR
2006
IEEE
16 years 8 months ago
Bijective Image Registration using Thin-Plate Splines
Image registration is the process of geometrically aligning two or more images. In this paper we describe a method for registering pairs of images based on thin-plate spline mappi...