268 search results - page 34 / 54 » Mixing time for the solid-on-solid model |
138
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
130
Voted
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
Complex design, targeting System-on-Chip based on reconfigurable architectures, still lacks a generalized methodology allowing both the automatic derivation of a complete system s...
149
click to vote
AAAI
2010
15 years 6 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
127
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
129
Voted
TNN
2008
15 years 4 months ago
2008
Separation of speech mixtures, often referred to as the cocktail party problem, has been studied for decades. In many source separation tasks, the separation method is limited by t...