Sciweavers

6833 search results - page 388 / 1367
» Some two-character sets
Sort
View
SIGACT
2008
103views more  SIGACT 2008»
15 years 6 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
IPM
2007
99views more  IPM 2007»
15 years 6 months ago
Older versions of the ROUGEeval summarization evaluation system were easier to fool
We show some limitations of the ROUGE evaluation method for automatic summarization. We present a method for automatic summarization based on a Markov model of the source text. By...
Jonas Sjöbergh
JC
2007
130views more  JC 2007»
15 years 6 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
JCT
2007
96views more  JCT 2007»
15 years 6 months ago
Induced subgraphs of Ramsey graphs with many distinct degrees
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
Boris Bukh, Benny Sudakov
CL
2000
Springer
15 years 6 months ago
Semantics of well-moded input-consuming logic programs
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
Annalisa Bossi, Sandro Etalle, Sabina Rossi