Sciweavers

413 search results - page 18 / 83
» On space constrained set selection problems
Sort
View
ICPR
2002
IEEE
14 years 8 months ago
Object Detection in Images: Run-Time Complexity and Parameter Selection of Support Vector Machines
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
Nicola Ancona, Grazia Cicirelli, Ettore Stella, Ar...
JMLR
2010
206views more  JMLR 2010»
13 years 2 months ago
Learning Translation Invariant Kernels for Classification
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...
Sayed Kamaledin Ghiasi Shirazi, Reza Safabakhsh, M...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
13 years 11 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
JMLR
2002
137views more  JMLR 2002»
13 years 7 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
TCS
1998
13 years 7 months ago
Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...
Peng-Jun Wan