11211 search results - page 2044 / 2243 » Rank-Sensitive Data Structures |
127
click to vote
ACL
2007
15 years 4 months ago
2007
This paper presents an application of PageRank, a random-walk model originally devised for ranking Web search results, to ranking WordNet synsets in terms of how strongly they pos...
123
click to vote
ACL
2007
15 years 4 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
135
click to vote
DAGSTUHL
2010
15 years 4 months ago
2010
While tensors occur in many areas of science and engineering, little has been done to visualize tensors with order higher than two. Tensors of higher orders can be used for exampl...
122
click to vote
CIDR
2007
15 years 4 months ago
2007
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
CAINE
2008
15 years 4 months ago
2008
For pilots the importance of knowing their height (distance above the ground) cannot be minimized. An error in determining height can easily prove fatal. Commercial and military a...