Sciweavers

580 search results - page 106 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
AOR
2006
95views more  AOR 2006»
13 years 7 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
CN
2002
82views more  CN 2002»
13 years 7 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
ARTCOM
2009
IEEE
14 years 2 months ago
An Efficient Bidirectional Frame Prediction Using Particle Swarm Optimization Technique
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
D. Ranganadham, Pavan Kumar Gorpuni
BICOB
2009
Springer
14 years 2 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
PASTE
2010
ACM
13 years 11 months ago
The RoadRunner dynamic analysis framework for concurrent programs
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...
Cormac Flanagan, Stephen N. Freund