Sciweavers

1283 search results - page 91 / 257
» Probabilistic structured query methods
Sort
View
WAIM
2007
Springer
14 years 3 months ago
An Efficient Spatial Search Method Based on SG-Tree
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
CICLING
2004
Springer
14 years 20 days ago
Language-Independent Methods for Compiling Monolingual Lexical Data
Abstract: In this paper we describe a flexible, portable and languageindependent infrastructure for setting up large monolingual language corpora. The approach is based on collecti...
Christian Biemann, Stefan Bordag, Gerhard Heyer, U...
DBSEC
2004
108views Database» more  DBSEC 2004»
13 years 10 months ago
Why Is this User Asking so Many Questions? Explaining Sequences of Queries
A sequence of queries submitted by a database user within a short period of time may have a single, illuminating explanation. In this paper we consider sequences of single-record q...
Aybar C. Acar, Amihai Motro
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 2 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 6 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon