237 search results - page 14 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
JMLR
2010
13 years 2 months ago
2010
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
The goal of semi-supervised image segmentation is to obtain the segmentation from a partially labeled image. By utilizing the image manifold structure in labeled and unlabeled pix...
CPM
2010
Springer
14 years 20 days ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
RT
2001
Springer
14 years 9 days ago
2001
Springer
Abstract. We present a new data structure for encoding the appearance of a geometric model as seen from a viewing region (view cell). This representation can be used in interactive...
JUCS
2007
13 years 7 months ago
2007
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...