16626 search results - page 340 / 3326 » Computing is a natural science |
163
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind ...
160
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
159
click to vote
TLCA
2007
Springer
16 years 28 days ago
2007
Springer
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
177
click to vote
ACSC
2006
IEEE
16 years 27 days ago
2006
IEEE
Pencil-and-paper exercises in public-key cryptography are important in learning the subject. It is desirable that a student doing such an exercise does not get the right answer by...
155
click to vote
FOCS
2006
IEEE
16 years 27 days ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...