11395 search results - page 2206 / 2279 » Beyond computer science |
172
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
143
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
161
click to vote
ERSHOV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Debugging virtual machines (VMs) presents unique challenges, especially meta-circular VMs, which are written in the same language they implement. Making sense of runtime ...
146
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
119
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...