8697 search results - page 1377 / 1740 » Measures of Distributional Similarity |
136
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
200
click to vote
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we present a new approach for segmentation of tubular structures in 2D images providing minimal interaction. The main objective is to extract centerlines and bounda...
172
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
166
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
203
click to vote
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...