189 search results - page 33 / 38 » Answering general time sensitive queries |
CIKM
2004
Springer
15 years 3 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
130
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
SACMAT
2004
ACM
15 years 3 months ago
2004
ACM
Ubiquitous computing uses a variety of information for which access needs to be controlled. For instance, a person’s current location is a sensitive piece of information, which ...
PODS
2010
ACM
15 years 2 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...