2950 search results - page 365 / 590 » Computing with Infinitely Many Processes |
186
click to vote
SPDP
1993
IEEE
15 years 10 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
172
Voted
INTERNET
2007
15 years 6 months ago
2007
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
176
click to vote
ACMICEC
2004
ACM
15 years 12 months ago
2004
ACM
Public administrations of all over the world invest an enormous amount of resources in e-government. How the success of egovernment can be measured is often not clear. E-governmen...
187
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
188
click to vote
ACL
1997
15 years 7 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...