Sciweavers

1110 search results - page 148 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
TON
2002
99views more  TON 2002»
15 years 3 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
CVPR
2007
IEEE
16 years 6 months ago
Soft Edge Smoothness Prior for Alpha Channel Super Resolution
Effective image prior is necessary for image super resolution, due to its severely under-determined nature. Although the edge smoothness prior can be effective, it is generally di...
Shengyang Dai, Mei Han, Wei Xu, Ying Wu, Yihong Go...
RECOMB
2007
Springer
16 years 4 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
CCECE
2006
IEEE
15 years 10 months ago
FPGA-Based SAT Solver
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
Mona Safar, M. Watheq El-Kharashi, Ashraf Salem
AIPS
2004
15 years 5 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck