Sciweavers

804 search results - page 13 / 161
» Solutions to Computational Problems Through Gene Assembly
Sort
View
97
Voted
WWW
2004
ACM
16 years 1 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...
120
Voted
CF
2009
ACM
15 years 7 months ago
Mapping the LU decomposition on a many-core architecture: challenges and solutions
Recently, multi-core architectures with alternative memory subsystem designs have emerged. Instead of using hardwaremanaged cache hierarchies, they employ software-managed embedde...
Ioannis E. Venetis, Guang R. Gao
89
Voted
COR
2008
88views more  COR 2008»
15 years 27 days ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
CVPR
2005
IEEE
16 years 2 months ago
A Minimal Solution for Relative Pose with Unknown Focal Length
Assume that we have two perspective images with known intrinsic parameters except for an unknown common focal length. It is a minimally constrained problem to find the relative or...
Henrik Stewénius, David Nistér, Fred...
TCBB
2008
113views more  TCBB 2008»
15 years 21 days ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause