7971 search results - page 35 / 1595 » On unbounded operators and applications |
90
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
Protocols which can tolerate any number of processors failing by ceasing operation for an unbounded number of steps and resuming operation (with or) without knowing that they were...
118
click to vote
GRAMMARS
2000
15 years 15 days ago
2000
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
70
Voted
MICRO
2000
IEEE
15 years 5 months ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
SRDS
2000
IEEE
15 years 5 months ago
2000
IEEE
USENIX
1990
15 years 1 months ago
1990