Sciweavers

1399 search results - page 106 / 280
» Multi-party Finite Computations
Sort
View
ICRA
2005
IEEE
141views Robotics» more  ICRA 2005»
14 years 3 months ago
On Computing Complex Navigation Functions
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
Luciano C. A. Pimenta, Alexandre R. Fonseca, Guilh...
DGCI
2008
Springer
13 years 12 months ago
Gift-Wrapping Based Preimage Computation Algorithm
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
Yan Gérard, Fabien Feschet, David Coeurjoll...
AUTOMATICA
2006
88views more  AUTOMATICA 2006»
13 years 10 months ago
Exact computation of amplification for a class of nonlinear systems arising from cellular signaling pathways
A commonly employed measure of the signal amplification properties of an input/output system is its induced L2 norm, sometimes also known as H gain. In general, however, it is ext...
Eduardo D. Sontag, Madalena Chaves
JIFS
2002
60views more  JIFS 2002»
13 years 9 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...
PODS
2004
ACM
130views Database» more  PODS 2004»
14 years 10 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders