Sciweavers

2095 search results - page 378 / 419
» Improved pebbling bounds
Sort
View
AAAI
2000
13 years 11 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
13 years 11 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
BMCBI
2010
102views more  BMCBI 2010»
13 years 10 months ago
Missing genes in the annotation of prokaryotic genomes
Background: Protein-coding gene detection in prokaryotic genomes is considered a much simpler problem than in intron-containing eukaryotic genomes. However there have been reports...
Andrew S. Warren, Jeremy S. Archuleta, Wu-chun Fen...
CGF
2010
193views more  CGF 2010»
13 years 10 months ago
Accelerated Visualization of Dynamic Molecular Surfaces
Molecular surfaces play an important role in studying the interactions between molecules. Visualizing the dynamic behavior of molecules is particularly interesting to gain insight...
Norbert Lindow, Daniel Baum, Steffen Prohaska, Han...
BMCBI
2006
159views more  BMCBI 2006»
13 years 10 months ago
EpiJen: a server for multistep T cell epitope prediction
Background: The main processing pathway for MHC class I ligands involves degradation of proteins by the proteasome, followed by transport of products by the transporter associated...
Irini A. Doytchinova, Pingping Guan, Darren R. Flo...