268 search results - page 9 / 54 » Mixing time for the solid-on-solid model |
178
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...
166
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
168
click to vote
PDP
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
150
click to vote
CCS
2004
ACM
15 years 11 months ago
2004
ACM
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
138
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we explore the problem of separating and localizing multiple maneuvering speakers in a reverberant environment. Moreover, the speakers can become silent intermitten...