Sciweavers

304 search results - page 15 / 61
» Dynamic ordered sets with exponential search trees
Sort
View
ICALP
1999
Springer
14 years 26 days ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
JAR
2010
98views more  JAR 2010»
13 years 3 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 10 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
14 years 10 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
ICCV
2009
IEEE
13 years 6 months ago
Efficient human pose estimation via parsing a tree structure based human model
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
Xiaoqin Zhang, Changcheng Li, Xiaofeng Tong, Weimi...