Sciweavers

5065 search results - page 676 / 1013
» Neural networks: Algorithms and applications
Sort
View
PAMI
2007
202views more  PAMI 2007»
15 years 7 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
187
Voted
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
CN
2006
161views more  CN 2006»
15 years 7 months ago
A multimedia traffic modeling framework for simulation-based performance evaluation studies
The emergence of high-speed communication systems has enabled the support of complex multimedia applications. The traffic patterns generated by such applications are likely to be ...
Assen Golaup, Hamid Aghvami
174
Voted
IPPS
2006
IEEE
16 years 1 months ago
Chedar: peer-to-peer middleware
In this paper we present a new peer-to-peer (P2P) middleware called CHEap Distributed ARchitecture (Chedar). Chedar is totally decentralized and can be used as a basis for P2P app...
Annemari Auvinen, Mikko Vapa, Matthieu Weber, Niko...
198
Voted
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 1 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier