3204 search results - page 595 / 641 » The b-chromatic Number of a Graph |
133
click to vote
CGO
2008
IEEE
16 years 12 days ago
2008
IEEE
In this paper we investigate the benefit of scheduling non-critical loads for a higher latency during software pipelining. "Noncritical" denotes those loads that have s...
189
click to vote
FOCS
2008
IEEE
16 years 11 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
148
click to vote
ICC
2008
IEEE
16 years 11 days ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
284
click to vote
ICCCN
2008
IEEE
16 years 11 days ago
2008
IEEE
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
170
click to vote
ICDM
2008
IEEE
16 years 11 days ago
2008
IEEE
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...