Sciweavers

1952 search results - page 184 / 391
» Complete partitions of graphs
Sort
View
EMMCVPR
2001
Springer
15 years 11 months ago
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
Bernd Fischer, Thomas Zöller, Joachim M. Buhm...
TON
2008
122views more  TON 2008»
15 years 6 months ago
Distributed throughput maximization in wireless mesh networks via pre-partitioning
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
15 years 6 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 7 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
BMCBI
2011
15 years 1 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek