24 search results - page 4 / 5 » Distances in random digital search trees |
112
click to vote
CLEF
2005
Springer
15 years 7 months ago
2005
Springer
This year we participated at 4 Question Answering tasks at CLEF: the Italian monolingual (I), Italian-English (I/E), Bulgarian monolingual (B), and Bulgarian-English (B/E) bilingu...
102
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
138
click to vote
SIGMOD
2011
ACM
14 years 4 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...
153
click to vote
ICDAR
2009
IEEE
14 years 11 months ago
2009
IEEE
This paper presents a segmentation-based handwriting recognizer and the performance that it achieves on the numerical fields extracted from a large single-writer historical collec...
117
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...