Sciweavers

2745 search results - page 373 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
BMCBI
2007
164views more  BMCBI 2007»
15 years 5 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
BMCBI
2006
137views more  BMCBI 2006»
15 years 5 months ago
A classification-based framework for predicting and analyzing gene regulatory response
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
Anshul Kundaje, Manuel Middendorf, Mihir Shah, Chr...
MOBIHOC
2002
ACM
16 years 4 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 5 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
GCC
2005
Springer
15 years 10 months ago
Coordinated Placement and Replacement for Grid-Based Hierarchical Web Caches
Web caching has been well accepted as a viable method for saving network bandwidth and reducing user access latency. To provide cache sharing on a large scale, hierarchical web cac...
Wenzhong Li, Kun Wu, Xu Ping, Ye Tao, Sanglu Lu, D...