Sciweavers

3652 search results - page 116 / 731
» A study of query length
Sort
View
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
13 years 9 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra
CCCG
2008
13 years 9 months ago
Searching for Frequent Colors in Rectangles
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
Marek Karpinski, Yakov Nekrich
IFSA
2007
Springer
146views Fuzzy Logic» more  IFSA 2007»
14 years 2 months ago
Bipolar Queries Using Various Interpretations of Logical Connectives
In [1, 2] we studied various concepts of bipolar queries (cf. Dubois and Prade [3]). We advocated there the use of a fuzzified version of the original crisp definition introduced...
Slawomir Zadrozny, Janusz Kacprzyk
VLDB
1993
ACM
134views Database» more  VLDB 1993»
14 years 1 days ago
Dynamic Memory Allocation for Multiple-Query Workloads
This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling...
Manish Mehta 0002, David J. DeWitt
SSD
2005
Springer
175views Database» more  SSD 2005»
14 years 1 months ago
Probabilistic Spatial Queries on Existentially Uncertain Data
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei...