1399 search results - page 124 / 280 » Multi-party Finite Computations |
136
click to vote
VISUALIZATION
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper describes some fundamental issues for robust implementations of progressively refined tetrahedralizations generated through sequences of edge collapses. We address the ...
142
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
124
click to vote
ACL
1998
15 years 5 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
139
click to vote
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...