Sciweavers

5864 search results - page 255 / 1173
» Can We Work around Numerical Methods
Sort
View
JMLR
2008
151views more  JMLR 2008»
15 years 6 months ago
Learning to Combine Motor Primitives Via Greedy Additive Regression
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
Manu Chhabra, Robert A. Jacobs
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
15 years 7 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
AC
1998
Springer
15 years 5 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
ICASSP
2011
IEEE
14 years 10 months ago
System-theoretic formulation and analysis of dynamic consensus propagation
In our previous work we have proposed a dynamic version of the consensus propagation (CP) algorithm introduced by Moallemi and Van Roy. Here, we pursue a system theoretic approach...
Valentin Schwarz, Gerald Matz
COMPGEOM
1997
ACM
15 years 10 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...