Sciweavers

921 search results - page 45 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
122
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
MIMO UWB Systems Based on Linear Precoded OFDM for Home Gigabit Applications
Abstract— In this paper, we investigate the use of multipleinput multiple-output (MIMO) techniques with linear precoded orthogonal frequency division multiplexing (LP-OFDM) wavef...
Antoine Stephan, Jean-François Hélar...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
16 years 5 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
DAWAK
2005
Springer
15 years 9 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 5 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
BMCBI
2008
103views more  BMCBI 2008»
15 years 4 months ago
Discovering multi-level structures in bio-molecular data through the Bernstein inequality
Background: The unsupervised discovery of structures (i.e. clusterings) underlying data is a central issue in several branches of bioinformatics. Methods based on the concept of s...
Alberto Bertoni, Giorgio Valentini