Sciweavers

4372 search results - page 35 / 875
» Algorithmic Theories of Everything
Sort
View
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 2 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
ATAL
2005
Springer
14 years 2 months ago
Towards a theory of "local to global" in distributed multi-agent systems (I)
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
Daniel Yamins
IJON
1998
158views more  IJON 1998»
13 years 8 months ago
Bayesian Kullback Ying-Yang dependence reduction theory
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
Lei Xu
TIP
2010
176views more  TIP 2010»
13 years 3 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
PAMI
2011
12 years 11 months ago
Meta-Recognition: The Theory and Practice of Recognition Score Analysis
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...
Walter J. Scheirer, Anderson Rocha, Ross J. Michea...