5592 search results - page 61 / 1119 » On Random Betweenness Constraints |
128
click to vote
IGPL
2006
15 years 4 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
134
click to vote
DKE
2002
15 years 3 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
132
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
126
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Technological constraints severely limit the rate at which analog-todigital converters can reliably sample signals. Recently, Tropp et al. proposed an architecture, termed the ran...
180
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...