683 search results - page 27 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
ACL
2012
11 years 10 months ago
2012
This paper presents a novel sequence labeling model based on the latent-variable semiMarkov conditional random fields for jointly extracting argument roles of events from texts. ...