Sciweavers

234 search results - page 14 / 47
» Rademacher Margin Complexity
Sort
View
RSA
2010
104views more  RSA 2010»
13 years 5 months ago
An approximation algorithm for counting contingency tables
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
Alexander I. Barvinok, Zur Luria, Alex Samorodnits...
JSAT
2007
63views more  JSAT 2007»
13 years 7 months ago
The Complexity of Some Subclasses of Minimal Unsatis able Formulas
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
Hans Kleine Büning, Xishun Zhao
FLAIRS
2006
13 years 8 months ago
Annotation of the Complex Terms in Multilingual Corpora
For a long time categorial grammars were regarded as "toys grammars". Indeed, in spite of a very solid theoretical base, categorial grammars remain rather marginal as so...
Ismaïl Biskri, Boubaker Meddeb-Hamrouni, Nico...
PR
2011
12 years 10 months ago
A novel multi-view learning developed from single-view patterns
The existing Multi-View Learning (MVL) learns how to process patterns with multiple information sources. In generalization this MVL is proven to have a significant advantage over...
Zhe Wang, Songcan Chen, Daqi Gao
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 22 days ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly