Sciweavers

4117 search results - page 341 / 824
» On the Satisfiability of Complex Constraints
Sort
View
179
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
14 years 10 months ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha
722
Voted

Presentation
956views
14 years 21 days ago
A Method for Distributed Computaion of Semi-Optimal Multicast Tree in MANET
In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on Genetic Algorithm (GA). This...
164
Voted
ICIP
2002
IEEE
16 years 8 months ago
Face detection using coarse-to-fine support vector classifiers
We describe a new face detection algorithm based on a hierarchy of support vector classifiers (SVMs) designed for efficient computation. The hierarchy serves as a platform for a c...
Hichem Sahbi, Donald Geman, Nozha Boujemaa
173
Voted
CADE
2007
Springer
16 years 7 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel