11211 search results - page 241 / 2243 » Rank-Sensitive Data Structures |
203
click to vote
INEX
2005
Springer
15 years 12 months ago
2005
Springer
Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents formatted in XML are appropriately represented as graph ...
248
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
216
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...
186
click to vote
VMCAI
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
179
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...