Sciweavers

1258 search results - page 116 / 252
» Architecture-driven Problem Decomposition
Sort
View
DATE
2007
IEEE
146views Hardware» more  DATE 2007»
16 years 1 months ago
Data-flow transformations using Taylor expansion diagrams
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
Maciej J. Ciesielski, Serkan Askar, Daniel Gomez-P...
141
Voted
IWANN
2007
Springer
16 years 1 months ago
An EA Multi-model Selection for SVM Multiclass Schemes
Multiclass problems with binary SVM classifiers are commonly treated as a decomposition in several binary sub-problems. An open question is how to properly tune all these sub-prob...
Gilles Lebrun, Olivier Lezoray, Christophe Charrie...
ICRA
2006
IEEE
161views Robotics» more  ICRA 2006»
16 years 1 months ago
Quadruped Robot Obstacle Negotiation via Reinforcement Learning
— Legged robots can, in principle, traverse a large variety of obstacles and terrains. In this paper, we describe a successful application of reinforcement learning to the proble...
Honglak Lee, Yirong Shen, Chih-Han Yu, Gurjeet Sin...
DMSN
2004
ACM
16 years 26 days ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
188
Voted
ICPP
1996
IEEE
15 years 11 months ago
On the Scalability of 2-D Wavelet Transform Algorithms on Fine-grained Parallel Machines
: We study the scalability of 2-D discrete wavelet transform algorithms on fine-grained parallel architectures. The principal operation in the 2-D DWT is the filtering operation us...
Jamshed N. Patel, Ashfaq A. Khokhar, Leah H. Jamie...