Sciweavers

157 search results - page 22 / 32
» Symmetrizations for clustering directed graphs
Sort
View
ICML
2004
IEEE
14 years 7 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
IPPS
2006
IEEE
14 years 22 days ago
A simulator for parallel applications with dynamically varying compute node allocation
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
Basile Schaeli, B. Gerlach, Roger D. Hersch
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
14 years 9 days ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
BMCBI
2010
120views more  BMCBI 2010»
13 years 6 months ago
Examination of the relationship between essential genes in PPI network and hub proteins in reverse nearest neighbor topology
Background: In many protein-protein interaction (PPI) networks, densely connected hub proteins are more likely to be essential proteins. This is referred to as the "centralit...
Kang Ning, Hoong Kee Ng, Sriganesh Srihari, Hon Wa...
BMCBI
2007
86views more  BMCBI 2007»
13 years 6 months ago
Tandem mass spectrometry data quality assessment by self-convolution
Background: Many algorithms have been developed for deciphering the tandem mass spectrometry (MS) data sets. They can be essentially clustered into two classes. The first performs...
Keng Wah Choo, Wai Mun Tham