2107 search results - page 41 / 422 » Computing Small Search Numbers in Linear Time |
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
Web search behaviour studies, including eye-tracking studies of search result examination, have resulted in numerous insights to improve search result quality and presentation. Ye...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
ATMOS
2010
13 years 6 months ago
2010
Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So...
PVLDB
2010
13 years 2 months ago
2010
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...