9997 search results - page 1800 / 2000 » The case for crowd computing |
174
click to vote
SPAA
1997
ACM
15 years 10 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
162
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
1- A methodology is presented in this paper for determining an optimal set of clock path delays for designing high performance VLSI/ULSI-based clock distribution networks. This met...
300
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...
185
click to vote
LPKR
1997
Springer
15 years 10 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
203
click to vote
STACS
1992
Springer
15 years 10 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...