Sciweavers

6939 search results - page 845 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
ICCAD
2001
IEEE
91views Hardware» more  ICCAD 2001»
16 years 4 months ago
A System for Synthesizing Optimized FPGA Hardware from MATLAB
Efficient high level design tools that can map behavioral descriptions to FPGA architectures are one of the key requirements to fully leverage FPGA for high throughput computatio...
Malay Haldar, Anshuman Nayak, Alok N. Choudhary, P...
ICIP
2009
IEEE
15 years 5 months ago
Highly-parallelized motion estimation for Scalable Video Coding
In this paper, we discuss the design of a highly-parallel motion estimator for real-time Scalable Video Coding (SVC). In an SVC, motion is commonly estimated bidirectionally and o...
Marijn J. H. Loomans, Cornelis J. Koeleman, Peter ...
227
Voted
ICANN
2005
Springer
16 years 25 days ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
SPAA
2009
ACM
16 years 7 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...