8699 search results - page 209 / 1740 » Elements of the Theory of Computation |
179
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
189
click to vote
PERCOM
2004
ACM
16 years 6 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...
120
click to vote
ICALP
2003
Springer
15 years 11 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,
186
click to vote
ICCV
1995
IEEE
15 years 10 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...
191
click to vote
APN
2008
Springer
15 years 8 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...