10447 search results - page 1807 / 2090 » The Philosophy of Computer Science |
172
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
163
click to vote
INLG
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Although humans are the ultimate “natural language generators”, the area of psycholinguistic modeling has been somewhat underrepresented in recent approaches to Natur...
187
click to vote
LATIN
2004
Springer
16 years 1 days ago
2004
Springer
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
172
click to vote
MABS
2004
Springer
16 years 1 days ago
2004
Springer
The emerging ”Computational Grid” infrastructure poses many new opportunities for the developing science of large scale multiagent simulation. The ability to migrate agent expe...
193
click to vote
MFCS
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....