Sciweavers

1429 search results - page 224 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Collaborative Tracking of Multiple Targets
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
Ting Yu, Ying Wu
INFOCOM
2009
IEEE
14 years 2 months ago
Multi-VPN Optimization for Scalable Routing via Relaying
—Enterprise networks are increasingly adopting Layer 3 Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) technology to connect geographically disparate locations...
MohammadHossein Bateni, Alexandre Gerber, Mohammad...
RECOMB
2006
Springer
14 years 8 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
COMPGEOM
2009
ACM
14 years 2 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
JCC
2006
110views more  JCC 2006»
13 years 7 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs