18188 search results - page 3373 / 3638 » Evaluation for Collaborative Systems |
195
click to vote
ACL
2009
15 years 4 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
191
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
189
click to vote
CICLING
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
209
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
168
click to vote
FAST
2009
15 years 4 months ago
2009
Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fau...