10792 search results - page 328 / 2159 » An Evaluation of Non-Equijoin Algorithms |
204
click to vote
PRDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
211
click to vote
IEEEPACT
2007
IEEE
16 years 1 months ago
2007
IEEE
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and threadlevel parallelism. In this...
195
click to vote
VLDB
2007
ACM
16 years 27 days ago
2007
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
186
Voted
WAW
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
164
click to vote
ROBIO
2006
IEEE
16 years 25 days ago
2006
IEEE
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...