2107 search results - page 115 / 422 » Computing Small Search Numbers in Linear Time |
121
Voted
PAM
2004
Springer
15 years 8 months ago
2004
Springer
Fast routing convergence is a key requirement for services that rely on stringent QoS. Yet experience has shown that the standard inter-domain routing protocol, BGP4, takes, at tim...
135
Voted
ICIAR
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes an iterative methodology for real-time robust mosaic topology inference. It tackles the problem of optimal feature selection (optimal sampling) for global estim...
158
Voted
CONCUR
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
153
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
152
Voted
MMB
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...