Sciweavers

3204 search results - page 439 / 641
» The Alcuin Number of a Graph
Sort
View
GC
2007
Springer
15 years 7 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
TIT
2008
129views more  TIT 2008»
15 years 6 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
15 years 5 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
SIGSOFT
2010
ACM
15 years 1 months ago
Path-based fault correlations
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
Wei Le, Mary Lou Soffa
SIGMOD
2011
ACM
270views Database» more  SIGMOD 2011»
14 years 9 months ago
Automatic discovery of attributes in relational databases
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...