5608 search results - page 124 / 1122 » On the Theory of Matchgate Computations |
120
Voted
SODA
2000
ACM
15 years 3 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
138
click to vote
PERCOM
2004
ACM
16 years 1 months ago
2004
ACM
This paper proposes initial steps towards a conceptual framework for context-aware systems. It is an attempt towards a general context model to aid thinking and describing context...
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
Discounting the future means that the value, today, of a unit payoff is 1 if the payoff occurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow,
121
click to vote
ICCV
1995
IEEE
15 years 5 months ago
1995
IEEE
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
131
click to vote
APN
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...