Sciweavers

1712 search results - page 31 / 343
» A Computational Approach to Binding Theory
Sort
View
EATCS
2002
46views more  EATCS 2002»
14 years 11 months ago
Understanding the Mulmuley-Sohoni Approach to P vs. NP
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
Kenneth W. Regan
AINA
2009
IEEE
15 years 6 months ago
Towards a Rational Approach for the Logical Modelling of Inhibition in Metabolic Networks
—This paper makes two contributions towards the logical modelling of inhibition in metabolic networks. First it exposes the logical inconsistency of an existing state-of-the-art ...
Oliver Ray
WWW
2005
ACM
16 years 14 days ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
IVC
2000
173views more  IVC 2000»
14 years 11 months ago
A computational approach to color adaptation effects
The human vision system has adaptation mechanisms that cannot be managed with the classic tri-stimulus color theory. The effects of these mechanisms are clearly visible in some we...
Daniele Marini, Alessandro Rizzi
ICPR
2008
IEEE
15 years 6 months ago
On-line novelty detection using the Kalman filter and extreme value theory
Novelty detection is concerned with identifying abnormal system behaviours and abrupt changes from one regime to another. This paper proposes an on-line (causal) novelty detection...
Hyoungjoo Lee, Stephen J. Roberts