Sciweavers

1746 search results - page 123 / 350
» A linear implementation of PACMAN
Sort
View
ICFP
2007
ACM
14 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
BMCBI
2006
202views more  BMCBI 2006»
13 years 9 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 4 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
ICRA
2005
IEEE
152views Robotics» more  ICRA 2005»
14 years 2 months ago
Dynamic Vehicle Localization using Constraints Propagation Techniques on Intervals A comparison with Kalman Filtering
-In order to implement a continuous and robust dynamic localization of a mobile robot, the fusion of dead reckoning and absolute sensors is often used. Depending on the objectives ...
Amadou Gning, Philippe Bonnifait
ICANN
2005
Springer
14 years 2 months ago
Evolving Modular Fast-Weight Networks for Control
Abstract. In practice, almost all control systems in use today implement some form of linear control. However, there are many tasks for which conventional control engineering metho...
Faustino J. Gomez, Jürgen Schmidhuber