5100 search results - page 821 / 1020 » The Linear Complexity of a Graph |
200
click to vote
DATAMINE
2010
15 years 6 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
161
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
213
click to vote
BMCBI
2006
15 years 6 months ago
2006
Integration of heterogeneous data types is a challenging problem, especially in biology, where the number of databases and data types increase rapidly. Amongst the problems that o...
172
click to vote
CAL
2006
15 years 6 months ago
2006
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
144
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...