Sciweavers

4047 search results - page 215 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
EUROCOLT
1999
Springer
15 years 10 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
DLT
2007
15 years 7 months ago
Coding Partitions: Regularity, Maximality and Global Ambiguity
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In...
Marie-Pierre Béal, Fabio Burderi, Antonio R...
TRS
2008
15 years 6 months ago
Generalized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
Wojciech Jaworski
ICDT
2010
ACM
219views Database» more  ICDT 2010»
16 years 3 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...