Sciweavers

1159 search results - page 107 / 232
» Binary Decision Graphs
Sort
View
STACS
2004
Springer
15 years 11 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
PODC
2011
ACM
14 years 9 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
16 years 26 days ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
ICDAR
2005
IEEE
16 years 22 hour ago
The Recognition Strategy Language
The table recognition literature contains many strategies specified informally as a sequence of operations, obscuring both models of table structure and the effects of individual...
Richard Zanibbi, Dorothea Blostein, James R. Cordy
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 6 months ago
Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
Gesualdo Scutari, Sergio Barbarossa