1429 search results - page 200 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ALMOB
2006
13 years 7 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
CGF
2006
13 years 7 months ago
2006
We present a technique for rendering reflections on complex reflectors at interactive rates based on approximating the geometry of the reflected scene with impostors. The reflecti...
JSAC
2006
13 years 7 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
ICCV
2009
IEEE
15 years 21 days ago
2009
IEEE
Scenes with cast shadows can produce complex sets of
images. These images cannot be well approximated by lowdimensional
linear subspaces. However, in this paper we
show that the...