3818 search results - page 547 / 764 » Word Problems on Compressed Words |
162
click to vote
ISCA
1993
IEEE
15 years 10 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
158
click to vote
COLT
1994
Springer
15 years 10 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
165
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
194
click to vote
ESA
1993
Springer
15 years 10 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
157
click to vote
ISMIS
1994
Springer
15 years 10 months ago
1994
Springer
Abstract: While the problem of incompletedata in databases has been extensively studied, a relatively unexplored form of uncertainty in databases, called inaccurate data, demands d...