285 search results - page 42 / 57 » New Ways to Construct Binary Search Trees |
ADBIS
2007
Springer
15 years 5 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
CONSTRAINTS
2010
14 years 11 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
114
click to vote
WWW
2001
ACM
16 years 11 days ago
2001
ACM
The research in information extraction (IE) regards the generation of wrappers that can extract particular information from semistructured Web documents. Similar to compiler gener...
108
click to vote
NIPS
1990
15 years 26 days ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
113
click to vote
OSDI
2008
ACM
16 years 9 hour ago
2008
ACM
Previous work showed that statistical analysis techniques could successfully be used to construct compact signatures of distinct operational problems in Internet server systems. B...