Sciweavers

16430 search results - page 2780 / 3286
» On Computable Tree Functions
Sort
View
ICDAR
2011
IEEE
14 years 6 months ago
Three Dimensional Rotation-Free Recognition of Characters
—In this paper, we propose a new method for three dimensional rotation-free recognition of characters in scene. In the proposed method, we employ the Modified Quadratic Discrimi...
Ryo Narita, Wataru Ohyama, Tetsushi Wakabayashi, F...
AOSD
2012
ACM
14 years 2 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
ICA
2012
Springer
14 years 2 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
JMLR
2012
13 years 9 months ago
Metric and Kernel Learning Using a Linear Transformation
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
13 years 9 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
« Prev « First page 2780 / 3286 Last » Next »