Sciweavers

736 search results - page 56 / 148
» A dynamic data structure for approximate range searching
Sort
View
CCCG
1993
13 years 10 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 10 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
DKE
2002
107views more  DKE 2002»
13 years 8 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 9 months ago
Multi-dimensional search for personal information management systems
With the explosion in the amount of semi-structured data users access and store in personal information management systems, there is a need for complex search tools to retrieve of...
Amélie Marian, Christopher Peery, Thu D. Ng...
CVPR
2010
IEEE
14 years 4 months ago
Efficient Action Spotting based on a Spacetime Oriented Structure Representation
This paper addresses action spotting, the spatiotemporal detection and localization of human actions in video. A novel compact local descriptor of video dynamics in the context of...
Konstantinos Derpanis, Mikhail Sizintsev, Kevin Ca...