3575 search results - page 334 / 715 » Structured motifs search |
164
click to vote
EMO
2003
Springer
16 years 3 days ago
2003
Springer
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
199
click to vote
ICDM
2002
IEEE
15 years 12 months ago
2002
IEEE
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...
208
click to vote
SSD
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach f...
183
click to vote
SIGIR
2000
ACM
15 years 11 months ago
2000
ACM
We present a method of searching text collections that takes advantage of hierarchrical information within documents and integrates searches of structured and unstructured data. W...
191
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 [...