Sciweavers

2693 search results - page 48 / 539
» On Computing Complex Navigation Functions
Sort
View
CADUI
2004
14 years 11 months ago
A Lightweight Experiment Management System for Handheld Computers
: This paper describes a system that helps HCI practitioners and researchers manage and conduct experiments involving context-sensitive handheld applications, particularly related ...
Philip D. Gray, Joy Goodman, James Macleod
COMPGEOM
2005
ACM
14 years 11 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
DAM
2007
77views more  DAM 2007»
14 years 9 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 1 months ago
Efficient Maximum Likelihood Estimation of a 2-D Complex Sinusoidal Based on Barycentric Interpolation
This paper presents an efficient method to compute the maximum likelihood (ML) estimation of the parameters of a complex 2-D sinusoidal, with the complexity order of the FFT. The...
J. Selva
AI50
2006
15 years 1 months ago
AI in Locomotion: Challenges and Perspectives of Underactuated Robots
Abstract. This article discusses the issues of adaptive autonomous navigation as a challenge of artificial intelligence. We argue that, in order to enhance the dexterity and adapti...
Fumiya Iida, Rolf Pfeifer, André Seyfarth