1449 search results - page 90 / 290 » Self-Randomized Exponentiation Algorithms |
151
click to vote
JCT
2010
15 years 4 months ago
2010
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ...
146
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
202
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
193
click to vote
COLING
2010
15 years 1 months ago
2010
This paper presents a novel semisupervised learning algorithm called Active Deep Networks (ADN), to address the semi-supervised sentiment classification problem with active learni...