1284 search results - page 8 / 257 » Connectivity in Bag Generation |
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
112
click to vote
ALENEX
2003
15 years 1 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of t...
EUROCRYPT
2003
Springer
15 years 5 months ago
2003
Springer
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking gen...