Sciweavers

188 search results - page 10 / 38
» Finding Best k Policies
Sort
View
BMCBI
2007
247views more  BMCBI 2007»
13 years 10 months ago
A survey of DNA motif finding algorithms
Background: Unraveling the mechanisms that regulate gene expression is a major challenge in biology. An important task in this challenge is to identify regulatory elements, especi...
Modan K. Das, Ho-Kwok Dai
RECOMB
2005
Springer
14 years 10 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
VTC
2008
IEEE
173views Communications» more  VTC 2008»
14 years 4 months ago
Adaptive Call Admission Control with Dynamic Resource Reallocation for Cell-Based Multirate Wireless Systems
—This paper studies the admission control and resource allocation in a cell-based wireless system that supports singlemedia and multirate services. Utilizing the idea of adaptive...
Kai-Wei Ke, Chen-Nien Tsai, Ho-Ting Wu, Chia-Hao H...
DGO
2007
96views Education» more  DGO 2007»
13 years 11 months ago
Open standards and the role of politics
A necessary part of digital government is the use of standards that allow for technologies to interconnect and interoperate. A growing debate among the technical and policy commun...
Rajiv C. Shah, Jay P. Kesan
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 9 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri