3268 search results - page 469 / 654 » The hub number of a graph |
165
click to vote
ICTAI
2003
IEEE
15 years 11 months ago
2003
IEEE
We investigate two seemingly incompatible approaches for improving document retrieval performance in the context of question answering: query expansion and query reduction. Querie...
149
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
180
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
162
click to vote
CICLING
2003
Springer
15 years 11 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
160
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...