Sciweavers

5153 search results - page 133 / 1031
» Introduction to Randomized Algorithms
Sort
View
ANCS
2009
ACM
15 years 12 days ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin
143
Voted
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 4 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
BMCBI
2008
169views more  BMCBI 2008»
15 years 2 months ago
A comprehensive comparison of random forests and support vector machines for microarray-based cancer classification
Background: Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular sig...
Alexander R. Statnikov, Lily Wang, Constantin F. A...
SECON
2007
IEEE
15 years 8 months ago
Fairness and Physical Layer Capture in Random Access Networks
Abstract— While physical layer capture has been observed in real implementations of wireless devices which randomly accessing shared channels, fair rate control algorithms based ...
Hoon Chang, Vishal Misra, Dan Rubenstein
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 8 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze