Sciweavers

12257 search results - page 498 / 2452
» Analysis of Algorithms
Sort
View
SPAA
1996
ACM
15 years 9 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 6 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
INFOCOM
1998
IEEE
15 years 9 months ago
Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors
While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is t...
T. S. Eugene Ng, Ion Stoica, Hui Zhang
RECOMB
2002
Springer
16 years 5 months ago
Phase-independent rhythmic analysis of genome-wide expression patterns
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...
Christopher James Langmead, Anthony K. Yan, C. Rob...
BMCBI
2006
100views more  BMCBI 2006»
15 years 5 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong