Sciweavers

Share
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
8 years 5 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
DMIN
2006
137views Data Mining» more  DMIN 2006»
8 years 5 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
CSREAESA
2004
8 years 5 months ago
Approaches for Monitoring Vectors on Microprocessor Buses
This paper introduces two new methods for observing and recording the vectors that have been asserted on a bus. The first is a software approach that uses a novel data structure s...
Hector Arteaga, Hussain Al-Asaad
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
8 years 5 months ago
Distribution-sensitive point location in convex subdivisions
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Sébastien Collette, Vida Dujmovic, John Iac...
ICVGIP
2008
8 years 5 months ago
Ray Casting Deformable Models on the GPU
The GPUs pack high computation power and a restricted architecture into easily available hardware today. They are now used as computation co-processors and come with programming m...
Suryakant Patidar, P. J. Narayanan
CCCG
2008
8 years 5 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
CCCG
2010
8 years 5 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
8 years 6 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
8 years 6 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
CONEXT
2008
ACM
8 years 6 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
books