1497 search results - page 139 / 300 » Online Negative Databases |
136
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
156
click to vote
ACCV
2007
Springer
15 years 8 months ago
2007
Springer
In dynamic scenes with occluding objects many features need to be tracked for a robust real-time camera pose estimation. An open problem is that tracking too many features has a ne...
117
click to vote
SP
2010
IEEE
15 years 8 months ago
2010
IEEE
Trusting a computer for a security-sensitive task (such as checking email or banking online) requires the user to know something about the computer’s state. We examine research ...
138
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
140
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...