4397 search results - page 363 / 880 » Relational Algebra Operations |
128
click to vote
ENTCS
2002
15 years 4 months ago
2002
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...
158
click to vote
JUCS
2002
15 years 4 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
141
click to vote
MST
1998
15 years 4 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
129
click to vote
SIAMCO
2002
15 years 4 months ago
2002
The paper introduces a new detectability concept for continuous-time Markov jump linear systems with finite Markov space that generalizes previous concepts found in the literature....
116
click to vote
MSCS
2007
15 years 4 months ago
2007
ction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of...