740 search results - page 114 / 148 » Lower bounds for Buchsbaum* complexes |
154
click to vote
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
163
click to vote
ICT
2004
Springer
15 years 11 months ago
2004
Springer
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
172
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
203
click to vote
ISVC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
160
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...