1449 search results - page 168 / 290 » Self-Randomized Exponentiation Algorithms |
162
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
153
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
165
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a novel classification model that is formulated as a ratio of semi-definite polynomials. We derive an efficient learning algorithm for this classifier, and apply it...
160
click to vote
ACSD
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
177
click to vote
ICRA
2005
IEEE
16 years 12 days ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...