5592 search results - page 61 / 1119 » On Random Betweenness Constraints |
IGPL
2006
13 years 10 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...
DKE
2002
13 years 9 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...
INFOCOM
2010
IEEE
13 years 8 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...
ICASSP
2011
IEEE
13 years 1 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...
GLOBECOM
2008
IEEE
14 years 4 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...