Sciweavers

1108 search results - page 173 / 222
» Minimalist Documentation of Frameworks
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 10 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
ICMLA
2007
15 years 7 months ago
Understanding Challenges in Preserving and Reconstructing Computer-Assisted Medical Decision Processes
— This paper addresses the problem of understanding preservation and reconstruction requirements for computeraided medical decision-making. With an increasing number of computer-...
Sang-Chul Lee, Peter Bajcsy
BMCBI
2007
123views more  BMCBI 2007»
15 years 6 months ago
BIRCH: A user-oriented, locally-customizable, bioinformatics system
Background: Molecular biologists need sophisticated analytical tools which often demand extensive computational resources. While finding, installing, and using these tools can be ...
Brian Fristensky
MMS
2008
15 years 6 months ago
Canonical processes for creating personalized semantically rich multimedia presentations
Authoring of multimedia content can be considered as composing media assets such as images, videos, text, and audio in time, space, and interaction into a coherent multimedia pres...
Ansgar Scherp
SADM
2008
178views more  SADM 2008»
15 years 5 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon