Sciweavers

1539 search results - page 34 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
117
Voted
SEFM
2008
IEEE
15 years 8 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
112
Voted
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
15 years 8 months ago
Mobile robot control in the road sign problem using Reservoir Computing networks
— In this work we tackle the road sign problem with Reservoir Computing (RC) networks. The T-maze task (a particular form of the road sign problem) consists of a robot in a T-sha...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
155
Voted
ICCV
2009
IEEE
14 years 12 months ago
Dense 3D reconstruction method using a single pattern for fast moving object
Dense 3D reconstruction of extremely fast moving objects could contribute to various applications such as body structure analysis and accident avoidance and so on. The actual case...
Ryusuke Sagawa, Yuichi Ota, Yasushi Yagi, Ryo Furu...
143
Voted
JAIR
2002
163views more  JAIR 2002»
15 years 1 months ago
Efficient Reinforcement Learning Using Recursive Least-Squares Methods
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...
Xin Xu, Hangen He, Dewen Hu
132
Voted
CSDA
2007
136views more  CSDA 2007»
15 years 2 months ago
A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
The maximum rank correlation (MRC) estimator was originally studied by Han [1987. Nonparametric analysis of a generalized regression model. J. Econometrics 35, 303–316] and Sher...
Hansheng Wang