10539 search results - page 369 / 2108 » On L |
108
Voted
SIGIR
2011
ACM
14 years 9 months ago
2011
ACM
137
Voted
ICDAR
2007
IEEE
16 years 1 months ago
2007
IEEE
186
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
143
click to vote
ALENEX
2004
15 years 8 months ago
2004
d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons
149
click to vote
ITA
2008
15 years 6 months ago
2008
A set T L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.