Sciweavers

3047 search results - page 59 / 610
» Randomized Parallel Selection
Sort
View
IPPS
2006
IEEE
15 years 4 months ago
A pattern selection algorithm for multi-pattern scheduling
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit
PCI
2005
Springer
15 years 3 months ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo
FUIN
2010
268views more  FUIN 2010»
14 years 4 months ago
Boruta - A System for Feature Selection
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
Miron B. Kursa, Aleksander Jankowski, Witold R. Ru...
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
15 years 1 months ago
Towards effective adaptive random testing for higher-dimensional input domains
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...
Johannes Mayer
ICIP
2010
IEEE
14 years 8 months ago
View synthesis based on Conditional Random Fields and graph cuts
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
Lam C. Tran, Christopher J. Pal, Truong Q. Nguyen