3471 search results - page 661 / 695 » Obstacle Numbers of Graphs |
160
Voted
FOCS
2008
IEEE
15 years 10 months 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:...
121
Voted
ICC
2008
IEEE
15 years 10 months 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...
250
click to vote
ICCCN
2008
IEEE
15 years 10 months 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...
133
click to vote
ICDM
2008
IEEE
15 years 10 months 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 ...
159
Voted
IEEEPACT
2008
IEEE
15 years 10 months ago
2008
IEEE
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...