4171 search results - page 611 / 835 » Choice numbers of graphs |
191
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
133
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
170
click to vote
ICTAI
2003
IEEE
15 years 12 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...
154
click to vote
SCAM
2003
IEEE
15 years 12 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...
183
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...