Sciweavers

95 search results - page 7 / 19
» Graph summarization with bounded error
Sort
View
CP
2011
Springer
13 years 9 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
VTS
2006
IEEE
93views Hardware» more  VTS 2006»
15 years 3 months ago
Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
Vishwani D. Agrawal, Soumitra Bose, Vijay Gangaram
CCS
2011
ACM
13 years 9 months ago
Automatic error finding in access-control policies
Verifying that access-control systems maintain desired security properties is recognized as an important problem in security. Enterprise access-control systems have grown to prote...
Karthick Jayaraman, Vijay Ganesh, Mahesh V. Tripun...
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 1 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
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...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
JACM
2000
131views more  JACM 2000»
14 years 9 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle