1839 search results - page 243 / 368 » Feature Selection in Clustering Problems |
SODA
2010
ACM
13 years 8 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
ICDAR
2011
IEEE
12 years 9 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
CVPR
2003
IEEE
15 years 5 days ago
2003
IEEE
A scene can be defined as one of the subdivisions of a play in which the setting is fixed, or when it presents continuous action in one place. We propose a novel two-pass algorith...