11211 search results - page 1642 / 2243 » Rank-Sensitive Data Structures |
207
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
205
click to vote
RIAO
2007
15 years 8 months ago
2007
This paper illustrates a ranking scheme which combines fulltext, anchor text and URL structure for homepage finding in hybrid peer-to-peer networks. The experimental results show...
161
click to vote
VMV
2008
15 years 8 months ago
2008
In computer graphics, procedural methods and Lsystems are common approaches to model complex botanical trees. In contrast to previous tree modeling systems, we propose linking rul...
202
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
167
click to vote
AAAI
2006
15 years 8 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...