Sciweavers

3641 search results - page 650 / 729
» On Computability of Pattern Recognition Problems
Sort
View
COMPGEOM
2006
ACM
13 years 12 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
INFOSCALE
2007
ACM
13 years 11 months ago
An agent-based decentralised process management framework for web service composition
Web service composition provision which requires efficient coordination of the execution of component services is a critical issue in service-oriented computing. Nowadays, BPEL4WS...
Jun Yan, Phillip Pidgeon, Aneesh Krishna, Jianming...
AR
2007
138views more  AR 2007»
13 years 10 months ago
Integrating robotics and neuroscience: brains for robots, bodies for brains
—Researchers in robotics and artificial intelligence have often looked at biology as a source of inspiration for solving their problems. From the opposite perspective, neuroscie...
Michele Rucci, Daniel Bullock, Fabrizio Santini
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 10 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
JOC
2008
92views more  JOC 2008»
13 years 10 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay