Sciweavers

3092 search results - page 82 / 619
» Where are you pointing
Sort
View
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 3 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
ENTCS
2006
138views more  ENTCS 2006»
13 years 10 months ago
Variables as Resource in Separation Logic
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
Richard Bornat, Cristiano Calcagno, Hongseok Yang
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 9 months ago
Competitive Spectrum Management with Incomplete Information
An important issue in wireless communication is the interaction between selfish and independent wireless communication systems in the same frequency band. Due to the selfish natur...
Yair Noam, Amir Leshem, Hagit Messer
AMOST
2005
ACM
14 years 3 months ago
Using information about functions in selecting test cases
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...
Markus Clermont, David Lorge Parnas
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
14 years 2 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle