Sciweavers

2137 search results - page 108 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
IJCAI
2007
14 years 5 days ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
DAC
1997
ACM
14 years 2 months ago
A Graph-Based Synthesis Algorithm for AND/XOR Networks
In this paper, we introduce a Shared Multiple Rooted XORbased Decomposition Diagram XORDD to represent functions with multiple outputs. Based on the XORDD representation, we dev...
Yibin Ye, Kaushik Roy
IPPS
2007
IEEE
14 years 5 months ago
Challenges in Mapping Graph Exploration Algorithms on Advanced Multi-core Processors
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...
Oreste Villa, Daniele Paolo Scarpazza, Fabrizio Pe...
AAI
2006
71views more  AAI 2006»
13 years 10 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
ICML
2005
IEEE
14 years 11 months ago
Online learning over graphs
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
Mark Herbster, Massimiliano Pontil, Lisa Wainer