Sciweavers

382 search results - page 77 / 77
» Term Disambiguation in Natural Language Query for XML
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 5 months ago
Lower bounds for dynamic connectivity
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...
Mihai Patrascu, Erik D. Demaine
CLEF
2007
Springer
13 years 11 months ago
Simple Morpheme Labelling in Unsupervised Morpheme Analysis
This paper presents my participation to the second Morpho Challenge. Results have been obtained with the algorithm already presented at Morpho Challenge 2005. The system takes a p...
Delphine Bernhard