13306 search results - page 422 / 2662 » Theoretical Computer Science |
162
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices de...
162
click to vote
RTA
1998
Springer
15 years 11 months ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
168
click to vote
SOFSEM
1998
Springer
15 years 11 months ago
1998
Springer
In our paper we discuss an approach to semiautomatic corpus processing aimed at analysing verb valencies in Czech and consecutive determining the type of TIL (Transparent Intension...
164
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
201
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...