Sciweavers

4539 search results - page 94 / 908
» Approaches to Compute Workflow Complexity
Sort
View
FCCM
2011
IEEE
251views VLSI» more  FCCM 2011»
14 years 1 months ago
A Scalable Multi-FPGA Platform for Complex Networking Applications
Abstract—Ballooning traffic volumes and increasing linkspeeds require ever high compute power to perform complex real-time processing of network packets. FPGAs have already been...
Sascha Mühlbach, Andreas Koch
ACII
2011
Springer
13 years 10 months ago
3D Corpus of Spontaneous Complex Mental States
Abstract. Hand-over-face gestures, a subset of emotional body language, are overlooked by automatic affect inference systems. We propose the use of hand-over-face gestures as a no...
Marwa Mahmoud, Tadas Baltrusaitis, Peter Robinson,...
CVPR
2009
IEEE
16 years 5 months ago
Discriminatively Trained Particle Filters for Complex Multi-Object Tracking
This work presents a discriminative training method for particle filters in the context of multi-object tracking. We are motivated by the difficulty of hand-tuning the many mode...
Alan Fern, Robin Hess
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
15 years 3 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 3 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran