3702 search results - page 394 / 741 » All Pairings Are in a Group |
236
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
182
click to vote
ASWEC
2008
IEEE
15 years 8 months ago
2008
IEEE
Today, agile methods become a popular approach to develop software systems. They try to satisfy customer, respond to changes, release in less time and achieve suitable profits for...
156
click to vote
BIRD
2008
Springer
2008
Springer
Translational Control by RNA-RNA Interaction: Improved Computation of RNA-RNA Binding Thermodynamics
15 years 8 months ago
The thermodynamics of RNA-RNA interaction consists of two components: the energy necessary to make a potential binding region accessible, i.e., unpaired, and the energy gained from...
239
click to vote
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
In recent years, many emerging database applications deal with large sets of continuously moving data objects. Since no computer system can commit continuously occurring infinitesi...
173
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...