973 search results - page 86 / 195 » New Bounds on Crossing Numbers |
CGF
2008
15 years 3 hour ago
2008
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
STACS
1999
Springer
15 years 4 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...
114
click to vote
CORR
2007
Springer
14 years 12 months ago
2007
Springer
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the gri...
SPIRE
2010
Springer
14 years 10 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...