Sciweavers

837 search results - page 1 / 168
» Hard combinators
Sort
View
HIPC
2003
Springer
13 years 10 months ago
Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
Basheer Al-Duwairi, Govindarasu Manimaran
CVPR
2000
IEEE
13 years 9 months ago
Learning Patterns from Images by Combining Soft Decisions and Hard Decisions
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
Pengyu Hong, Thomas S. Huang, Roy Wang
CVPR
1999
IEEE
14 years 7 months ago
Combining Information using Hard Constraints
Douglas DeCarlo, Dimitris N. Metaxas
ENTCS
2008
56views more  ENTCS 2008»
13 years 5 months ago
Hard combinators
Denis Béchet, Sylvain Lippi
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
13 years 4 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...