1132 search results - page 166 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
193
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
168
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
190
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we provide a lower and upper bound for the number of degrees of freedom (DOF) of B multipleinput single-output (MISO) broadcast channels (BC) where each base sta...
156
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
164
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...