886 search results - page 83 / 178 » Reasoning with contextual graphs |
135
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
165
click to vote
POPL
1993
ACM
15 years 8 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
145
click to vote
ENTCS
2008
15 years 4 months ago
2008
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
116
Voted
TSE
2008
15 years 4 months ago
2008
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
152
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...