Sciweavers

6368 search results - page 120 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
CORR
2009
Springer
242views Education» more  CORR 2009»
15 years 2 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
147
Voted
PDP
2008
IEEE
15 years 11 months ago
A Transformation Framework for Communicating Multiprocessor-Tasks
Parallel programming models based on a mixture of task and data parallelism have shown to be successful in addressing the increasing communication overhead of distributed memory p...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
CVPR
2011
IEEE
15 years 14 days ago
What You Saw is Not What You Get: Domain Adaptation Using Asymmetric Kernel Transforms
In real-world applications, “what you saw” during training is often not “what you get” during deployment: the distribution and even the type and dimensionality of features...
Brian Kulis, Kate Saenko, Trevor Darrell
LMCS
2007
132views more  LMCS 2007»
15 years 4 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
RECOMB
1997
Springer
15 years 9 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...