1686 search results - page 71 / 338 » Programs as polygraphs: computability and complexity |
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OF...
ISPASS
2010
IEEE
15 years 4 months ago
2010
IEEE
—While many-core accelerator architectures, such as today’s Graphics Processing Units (GPUs), offer orders of magnitude more raw computing power than contemporary CPUs, their m...
IUI
2009
ACM
15 years 6 months ago
2009
ACM
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...