2950 search results - page 123 / 590 » Computing with Infinitely Many Processes |
121
Voted
COLING
1996
15 years 3 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
163
click to vote
CAI
2002
Springer
15 years 2 months ago
2002
Springer
Grid technology has evolved over the past several years to provide the services and infrastructure needed for building "virtual" systems and organizations. With this Gri...
132
Voted
ATVA
2006
Springer
15 years 6 months ago
2006
Springer
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
168
Voted
FPL
2010
Springer
15 years 16 days ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
227
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...