9842 search results - page 1373 / 1969 » The Complexity of the Matching-Cut Problem |
174
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
161
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
207
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
197
click to vote
FASE
2010
Springer
16 years 2 months ago
2010
Springer
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
200
click to vote
IPSN
2009
Springer
16 years 2 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...