199 search results - page 25 / 40 » Fast Algorithms for Computing Tree LCS |
162
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
135
click to vote
DSSCV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Blurring an image with a Gaussian of width σ and considering σ as an extra dimension, extends the image to an Gaussian scale space (GSS) image. In this GSS-image the is...
145
click to vote
NAACL
2010
15 years 2 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
160
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
141
click to vote
PACT
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...