19866 search results - page 199 / 3974 » Computing all factorizations in *** |
144
click to vote
DAWAK
2004
Springer
15 years 12 months ago
2004
Springer
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
177
click to vote
MFCS
2004
Springer
15 years 12 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
137
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
179
click to vote
PKC
2000
Springer
15 years 10 months ago
2000
Springer
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
178
click to vote
TCS
2008
15 years 6 months ago
2008
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...