Sciweavers

19700 search results - page 41 / 3940
» DNA-Based Computation Times
Sort
View
ALMOB
2008
95views more  ALMOB 2008»
13 years 10 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 11 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
ICMCS
2006
IEEE
114views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Computing a Multimedia Representation for Documents Given Time and Display Constraints
It is difficult to view multipage, high resolution documents on devices with small displays. As a solution, we introduce a Multimedia Thumbnail representation, which can be seen a...
Berna Erol, Kathrin Berkner, Siddharth Joshi, Jona...
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
SIROCCO
2003
13 years 11 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...