10988 search results - page 212 / 2198 » Algorithmic Folding Complexity |
111
click to vote
MASCOTS
2004
15 years 5 months ago
2004
Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs ...
142
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
164
click to vote
COMAD
2009
15 years 4 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
134
click to vote
TC
2008
15 years 3 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
104
click to vote
TSP
2008
15 years 3 months ago
2008
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...