Sciweavers

15073 search results - page 2634 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
CONEXT
2009
ACM
15 years 5 months ago
Improving internet-wide routing protocols convergence with MRPC timers
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
Anthony J. Lambert, Marc-Olivier Buob, Steve Uhlig
CONEXT
2009
ACM
15 years 5 months ago
SafeGuard: safe forwarding during route changes
This paper presents the design and evaluation of SafeGuard, an intra-domain routing system that can safely forward packets to their destinations even when routes are changing. Saf...
Ang Li, Xiaowei Yang, David Wetherall
SIGCOMM
2010
ACM
15 years 4 months ago
R3: resilient routing reconfiguration
Network resiliency is crucial to IP network operations. Existing techniques to recover from one or a series of failures do not offer performance predictability and may cause serio...
Ye Wang, Hao Wang, Ajay Mahimkar, Richard Alimi, Y...
ECCV
2010
Springer
15 years 4 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
BMCBI
2007
165views more  BMCBI 2007»
15 years 4 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
« Prev « First page 2634 / 3015 Last » Next »