Sciweavers

656 search results - page 129 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 1 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ICS
2007
Tsinghua U.
15 years 7 months ago
A study of process arrival patterns for MPI collective operations
Process arrival pattern, which denotes the timing when different processes arrive at an MPI collective operation, can have a significant impact on the performance of the operatio...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan
AINA
2004
IEEE
15 years 5 months ago
Online Training of SVMs for Real-time Intrusion Detection
Abstract-- As intrusion detection essentially can be formulated as a binary classification problem, it thus can be solved by an effective classification technique-Support Vector Ma...
Zonghua Zhang, Hong Shen
ICALP
2005
Springer
15 years 6 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 3 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri