Sciweavers

18306 search results - page 425 / 3662
» Algorithmics in Exponential Time
Sort
View
COLING
2010
15 years 2 months ago
Active Deep Networks for Semi-Supervised Sentiment Classification
This paper presents a novel semisupervised learning algorithm called Active Deep Networks (ADN), to address the semi-supervised sentiment classification problem with active learni...
Shusen Zhou, Qingcai Chen, Xiaolong Wang
CORR
2012
Springer
198views Education» more  CORR 2012»
14 years 3 months ago
Lipschitz Parametrization of Probabilistic Graphical Models
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the ￿p-norm of the parameters. We discuss several implications ...
Jean Honorio
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 4 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
FOCS
2009
IEEE
16 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
ICPR
2004
IEEE
16 years 8 months ago
To FRAME or not to FRAME in Probabilistic Texture Modelling?
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...