Sciweavers

3758 search results - page 44 / 752
» A Complete Subsumption Algorithm
Sort
View
JPDC
2000
106views more  JPDC 2000»
13 years 7 months ago
Dual of a Complete Graph as an Interconnection Network
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
Si-Qing Zheng, Jie Wu
MOR
2000
90views more  MOR 2000»
13 years 7 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
ICIP
2000
IEEE
14 years 9 months ago
Spatially Adaptive Image Denoising Under OverComplete Expansion
This paper presents a novel wavelet-based image denoising algorithm under overcomplete expansion. In order to optimize the denoising performance, we make a systematic study of bot...
Xin Li, Michael T. Orchard
ICDAR
2009
IEEE
14 years 2 months ago
Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations
A new isolated handwritten Farsi numeral recognition algorithm is proposed in this paper, which exploits the sparse and over-complete structure from the handwritten Farsi numeral ...
Wumo Pan, Tien D. Bui, Ching Y. Suen
ECML
2007
Springer
14 years 1 months ago
Safe Q-Learning on Complete History Spaces
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
Stephan Timmer, Martin Riedmiller