9997 search results - page 394 / 2000 » The case for crowd computing |
159
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
130
click to vote
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
It has become increasingly difficult to drive a modern highperformance graphics accelerator at full speed with a serial immediate-mode graphics interface. To resolve this problem,...
164
click to vote
VISUALIZATION
1992
IEEE
15 years 10 months ago
1992
IEEE
This case study looks at the issues involved in operating a sophisticated scientific instrument as a computer peripheral accessible over a high-speed network. A custom interactive...
188
Voted
NC
2008
15 years 6 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
171
click to vote
COLING
2002
15 years 6 months ago
2002
This paper proposes a method to analyze Japanese anaphora, in which zero pronouns (omitted obligatory cases) are used to refer to preceding entities (antecedents). Unlike the case...