2941 search results - page 287 / 589 » The Myth of the Educational Computer |
128
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In [Spi], we developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, our...
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e. are not of the VCG family) and yet approximate the social welfare to within a factor of 1 ...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that e...