Sciweavers

3204 search results - page 595 / 641
» The b-chromatic Number of a Graph
Sort
View
CGO
2008
IEEE
14 years 2 months ago
Latency-tolerant software pipelining in a production compiler
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...
Sebastian Winkel, Rakesh Krishnaiyer, Robyn Sampso...
FOCS
2008
IEEE
14 years 2 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
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:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 2 months ago
Multilevel Structured Low-Density Parity-Check Codes
— 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...
Nicholas Bonello, Sheng Chen, Lajos Hanzo
ICCCN
2008
IEEE
14 years 2 months ago
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs
—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...
Avinash Srinivasan, Jie Wu
ICDM
2008
IEEE
150views Data Mining» more  ICDM 2008»
14 years 2 months ago
Pseudolikelihood EM for Within-network Relational Learning
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 ...
Rongjing Xiang, Jennifer Neville