Sciweavers

199 search results - page 25 / 40
» Intensional Positive Set Theory
Sort
View
MLG
2007
Springer
14 years 1 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 5 months ago
Using Semantic Wikis for Structured Argument in Medical Domain
This research applies ideas from argumentation theory in the context of semantic wikis, aiming to provide support for structured-large scale argumentation between human agents. The...
Adrian Groza, Radu Balaj
ATAL
2010
Springer
13 years 8 months ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
JUCS
2010
176views more  JUCS 2010»
13 years 6 months ago
An Approach to Generation of Decision Rules
: Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of...
Zhang Mingyi, Danning Li, Zhang Ying
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 2 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira