Sciweavers

40 search results - page 4 / 8
» Weighted graphs and disconnected components: patterns and a ...
Sort
View
PKDD
2010
Springer
155views Data Mining» more  PKDD 2010»
13 years 7 months ago
Latent Structure Pattern Mining
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
Andreas Maunz, Christoph Helma, Tobias Cramer, Ste...
ICDAR
2011
IEEE
12 years 8 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 1 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
ISSS
1999
IEEE
151views Hardware» more  ISSS 1999»
14 years 26 days ago
Optimized System Synthesis of Complex RT Level Building Blocks from Multirate Dataflow Graphs
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...
Jens Horstmannshoff, Heinrich Meyr
AAAI
2011
12 years 8 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev