Sciweavers

356 search results - page 30 / 72
» Further results on the subspace distance
Sort
View
TNN
2011
200views more  TNN 2011»
13 years 4 months ago
Domain Adaptation via Transfer Component Analysis
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. Intuitively, discovering a good feature rep...
Sinno Jialin Pan, Ivor W. Tsang, James T. Kwok, Qi...
PAMI
2008
162views more  PAMI 2008»
13 years 9 months ago
Bayes Optimality in Linear Discriminant Analysis
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Onur C. Hamsici, Aleix M. Martínez
PVLDB
2010
135views more  PVLDB 2010»
13 years 4 months ago
QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdi...
Jongwuk Lee, Seung-won Hwang
IEEEMSP
2002
IEEE
14 years 2 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
EUROCRYPT
2012
Springer
12 years 9 days ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...