Sciweavers

1282 search results - page 181 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
PAMI
2007
202views more  PAMI 2007»
15 years 3 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
NDSS
2009
IEEE
15 years 11 months ago
Coordinated Scan Detection
Coordinated attacks, where the tasks involved in an attack are distributed amongst multiple sources, can be used by an adversary to obfuscate his incursion. In this paper we prese...
Carrie Gates
AI
2002
Springer
15 years 4 months ago
Ensembling neural networks: Many could be better than all
Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its compone...
Zhi-Hua Zhou, Jianxin Wu, Wei Tang
INFOCOM
2006
IEEE
15 years 10 months ago
Evaluating Mobility Pattern Space Routing for DTNs
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
Jeremie Leguay, Timur Friedman, Vania Conan
IJPP
2008
74views more  IJPP 2008»
15 years 4 months ago
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan