1541 search results - page 95 / 309 » Analysis of Random Noise and Random Walk Algorithms |
108
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
136
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
122
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
128
Voted
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
RTOS Simulation Henning Zabel, Wolfgang Mueller Universität Paderborn, C-LAB Fürstenallee 11, D-33102 Paderborn, Germany —Today, mobile and embedded real-time systems have to c...
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...