Sciweavers

3192 search results - page 347 / 639
» The minimum latency problem
Sort
View
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 10 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 8 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
15 years 6 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
COMCOM
2007
103views more  COMCOM 2007»
15 years 6 months ago
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and est...
Kin-Hon Ho, Michael P. Howarth, Ning Wang, George ...
DAM
2007
120views more  DAM 2007»
15 years 6 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot