Sciweavers

11211 search results - page 466 / 2243
» Rank-Sensitive Data Structures
Sort
View
PAMI
2006
225views more  PAMI 2006»
15 years 6 months ago
Robust Structure and Motion from Outlines of Smooth Curved Surfaces
: This article addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive imag...
Yasutaka Furukawa, Amit Sethi, Jean Ponce, David J...
OOPSLA
1999
Springer
15 years 11 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
IPPS
1996
IEEE
15 years 11 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
IV
2007
IEEE
366views Visualization» more  IV 2007»
16 years 1 months ago
Algorithm Visualization in Teaching Spatial Data Algorithms
Algorithm visualization is a widely–used tool for teaching data structures and algorithms. Spatial data algorithms are algorithms that are designed to process multidimensional d...
Jussi Nikander, Juha Helminen
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
15 years 10 months ago
Finding Temporal Patterns by Data Decomposition
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
David C. Minnen, Christopher Richard Wren