80 search results - page 8 / 16 » Data reduction and exact algorithms for clique cover |
146
click to vote
SAC
1997
ACM
15 years 10 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
161
click to vote
CIKM
2009
Springer
16 years 18 days ago
2009
Springer
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...
188
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Abstract. We propose a new adaptive algorithm for the exact simultaneous resolution of several triangular systems over finite fields: it is composed of several practicable variants...
153
click to vote
CIT
2006
Springer
15 years 9 months ago
2006
Springer
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
158
click to vote
WABI
2009
Springer
16 years 19 days ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...