618 search results - page 124 / 124 » Computational Models of Natural Language Argument |
STOC
2004
ACM
15 years 10 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...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
91
Voted
MC
2003
14 years 11 months ago
2003
Web systems suffer from an inability to satisfy heterogeneous needs of many users. A remedy for the negative effects of the traditional "one-size-fits-all'' approac...