Sciweavers

5247 search results - page 478 / 1050
» Frequency Optimized Computation Methods
Sort
View
CORR
2002
Springer
93views Education» more  CORR 2002»
15 years 4 months ago
Synthesis of Low-Power Digital Circuits Derived from Binary Decision Diagrams
-- This paper introduces a novel method for synthesizing digital circuits derived from Binary Decision Diagrams (BDDs) that can yield to reduction in power dissipation. The power r...
Denis V. Popel
CVPR
2004
IEEE
16 years 6 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
130
Voted
IROS
2009
IEEE
125views Robotics» more  IROS 2009»
15 years 11 months ago
Planning and fast re-planning of safe motions for humanoid robots: Application to a kicking motion
Abstract— Optimal motions are usually used as joint reference trajectories for repetitive or complex motions. In the case of soccer robots, the kicking motion is usually a benchm...
Sebastien Lengagne, Philippe Fraisse, Nacim Ramdan...
LION
2009
Springer
210views Optimization» more  LION 2009»
15 years 11 months ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
Manuel López-Ibáñez, Christia...
ICPR
2008
IEEE
15 years 11 months ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato