Sciweavers

5329 search results - page 293 / 1066
» The Weighted Majority Algorithm
Sort
View
JGAA
2002
81views more  JGAA 2002»
15 years 6 months ago
Graph Drawing in Motion
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
Carsten Friedrich, Peter Eades
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 7 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
RECOMB
2006
Springer
16 years 7 months ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...
CEC
2007
IEEE
16 years 1 months ago
Improving generalization capability of neural networks based on simulated annealing
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...
Yeejin Lee, Jong-Seok Lee, Sun-Young Lee, Cheol Ho...
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
16 years 22 days ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...