Sciweavers

1284 search results - page 8 / 257
» Connectivity in Bag Generation
Sort
View
ICDM
2007
IEEE
150views Data Mining» more  ICDM 2007»
15 years 3 months ago
Connections between Mining Frequent Itemsets and Learning Generative Models
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...
Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ra...
COCOON
2007
Springer
15 years 3 months ago
Generating Minimal k-Vertex Connected Spanning Subgraphs
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.
Endre Boros, Konrad Borys, Khaled M. Elbassioni, V...
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
14 years 10 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
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...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
INFOCOM
2009
IEEE
15 years 4 months ago
An Economically-Principled Generative Model of AS Graph Connectivity
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...
Jacomo Corbo, Shaili Jain, Michael Mitzenmacher, D...
EUROCRYPT
2003
Springer
15 years 2 months ago
Predicting the Shrinking Generator with Fixed Connections
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...
Patrik Ekdahl, Willi Meier, Thomas Johansson