20745 search results - page 204 / 4149 » Computer graphics for all |
139
Voted
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
115
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
107
click to vote
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this paper a new algorithm is introduced to search for hard to find Williamson matrices. We ...
120
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
Re-Pair is a dictionary-based compression method invented in 1999 by Larsson and Moffat. Although its practical performance has been established through experiments, the method ha...
108
Voted
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...