35416 search results - page 6967 / 7084 » Evaluation |
171
click to vote
ALENEX
2009
15 years 4 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
169
click to vote
AMSTERDAM
2009
15 years 4 months ago
2009
The paper provides a compositional account of cumulative readings with non-increasing modified numerals (aka van Benthem's puzzle), e.g., Exactly three boys saw exactly five m...
173
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
168
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
194
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...