Sciweavers

932 search results - page 187 / 187
» Where in the Wikipedia Is That Answer
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 4 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
ISCI
2007
141views more  ISCI 2007»
13 years 4 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...