Sciweavers

1023 search results - page 177 / 205
» Graph model selection using maximum likelihood
Sort
View
JPDC
2008
110views more  JPDC 2008»
13 years 8 months ago
Parallel multilevel algorithms for hypergraph partitioning
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
Aleksandar Trifunovic, William J. Knottenbelt
BMCBI
2010
144views more  BMCBI 2010»
13 years 3 months ago
Optimizing Transformations for Automated, High Throughput Analysis of Flow Cytometry Data
Background: In a high throughput setting, effective flow cytometry data analysis depends heavily on proper data preprocessing. While usual preprocessing steps of quality assessmen...
Greg Finak, Juan-Manuel Perez, Andrew Weng, Raphae...
ICML
2006
IEEE
14 years 9 months ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 8 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
TCOM
2010
109views more  TCOM 2010»
13 years 7 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik