Sciweavers

2080 search results - page 101 / 416
» Collections, Cardinalities, and Relations
Sort
View
INFSOF
2002
78views more  INFSOF 2002»
15 years 6 months ago
Flow insensitive points-to sets
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...
Paul Anderson, David Binkley, Genevieve Rosay, Tim...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 6 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
GIS
2006
ACM
16 years 7 months ago
Efficient position-independent iconic search using an R-theta index
An iconic image database is a collection of symbolic images where each image is a collection of labeled point features called icons. A method is presented to support fast position...
Charles Ben Cranston, Hanan Samet
KR
2000
Springer
15 years 10 months ago
Representing and Aggregating Conflicting Beliefs
We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose a novel representation for collective beliefs that uses modular, tran...
Pedrito Maynard-Reid II, Daniel J. Lehmann
CIKM
2008
Springer
15 years 8 months ago
Retrievability: an evaluation measure for higher order information access tasks
Evaluation in Information Retrieval (IR) has long focused on effectiveness and efficiency. However, new and emerging access tasks now demand alternative evaluation measures which ...
Leif Azzopardi, Vishwa Vinay