Sciweavers

166 search results - page 25 / 34
» Semi-supervised Learning from Only Positive and Unlabeled Da...
Sort
View
MOC
2010
13 years 3 months ago
Entropy-satisfying relaxation method with large time-steps for Euler IBVPs
This paper could have been given the title: "How to positively and implicitly solve Euler equations using only linear scalar advections." The new relaxation method we pr...
Frédéric Coquel, Quang Long Nguyen, ...
PAMI
1998
87views more  PAMI 1998»
13 years 8 months ago
Learning Local Languages and Their Application to DNA Sequence Analysis
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
Takashi Yokomori, Satoshi Kobayashi
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 8 months ago
Inferring XML Schema Definitions from XML Data
Although the presence of a schema enables many optimizations for operations on XML documents, recent studies have shown that many XML documents in practice either do not refer to ...
Geert Jan Bex, Frank Neven, Stijn Vansummeren
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
13 years 7 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish