1188 search results - page 2 / 238 » Generating Connectives |
ALENEX
2003
13 years 6 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...
ICDM
2007
IEEE
13 years 11 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
13 years 11 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.
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
AINA
2008
IEEE
13 years 11 months ago
2008
IEEE
Selecting transparently a proper network connection for voice communication will be a fundamental requirement in future multi-mode heterogeneous wireless network. This paper exten...