Sciweavers

3406 search results - page 42 / 682
» Computational models of classical conditioning
Sort
View
SIROCCO
2008
13 years 10 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
IROS
2007
IEEE
123views Robotics» more  IROS 2007»
14 years 3 months ago
Natural task decomposition with intrinsic potential fields
— Any given task can be solved in a number of ways, whether through path-planning, modeling, or control techniques. In this paper, we present a methodology for natural task decom...
Stephen Hart, Roderic A. Grupen
ICIAP
2003
ACM
14 years 8 months ago
Object segmentation using feature based conditional morphology
This paper presents a new technique to segment objects of interest from cluttered background with varying edge densities and illumination conditions from gray scale imagery. An op...
M. Raffay Hamid, Aijaz Baloch, Ahmed Bilal, Nauman...
CIARP
2009
Springer
14 years 3 months ago
Finding Images with Similar Lighting Conditions in Large Photo Collections
When we look at images taken from outdoor scenes, much of the information perceived is due to the ligthing conditions. In these scenes, the solar beams interact with the atmosphere...
Mauricio Díaz, Peter F. Sturm
ASIACRYPT
2008
Springer
13 years 10 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...