Sciweavers

539 search results - page 60 / 108
» Recurrence relations and fast algorithms
Sort
View
111
Voted
DEBU
2010
128views more  DEBU 2010»
14 years 10 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 4 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
CVPR
2008
IEEE
16 years 2 months ago
Least squares congealing for unsupervised alignment of images
In this paper, we present an approach we refer to as "least squares congealing" which provides a solution to the problem of aligning an ensemble of images in an unsuperv...
Mark Cox, Sridha Sridharan, Simon Lucey, Jeffrey F...
77
Voted
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
15 years 6 months ago
Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case
Abstract— This paper presents a new approach to the multirobot map-alignment problem that enables teams of robots to build joint maps without initial knowledge of their relative ...
Xun S. Zhou, Stergios I. Roumeliotis
105
Voted
ECCV
2008
Springer
16 years 2 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson