5153 search results - page 790 / 1031 » Introduction to Randomized Algorithms |
152
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
173
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
164
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
171
Voted
CP
1995
Springer
15 years 10 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
135
click to vote
SIGGRAPH
1991
ACM
15 years 10 months ago
1991
ACM
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...