432 search results - page 34 / 87 » Internally deterministic parallel algorithms can be fast |
122
click to vote
PROCEDIA
2010
14 years 8 months ago
2010
Currently several computational problems require high processing power to handle huge amounts of data, although underlying core algorithms appear to be rather simple. Especially i...
133
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
118
click to vote
DFT
2008
IEEE
15 years 8 months ago
2008
IEEE
Integrated circuits (IC) targeting at the streaming applications for tomorrow are becoming a fast growing market. Applications such as beamforming require mass computing capabilit...
116
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
122
click to vote
DATE
2007
IEEE
15 years 8 months ago
2007
IEEE
One of the main tasks in analog design is the sizing of the circuit parameters, such as transistor lengths and widths, in order to obtain optimal circuit performances, such as hig...