Sciweavers

1282 search results - page 56 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
RIVF
2007
13 years 10 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
ICC
2011
IEEE
236views Communications» more  ICC 2011»
12 years 8 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...
ICCV
2007
IEEE
14 years 11 months ago
Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
BMCBI
2006
113views more  BMCBI 2006»
13 years 9 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
ATMOS
2010
172views Optimization» more  ATMOS 2010»
13 years 8 months ago
Column Generation Heuristic for a Rich Arc Routing Problem
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
Sébastien Lannez, Christian Artigues, Jean ...