2969 search results - page 36 / 594 » A space efficient algorithm for group structure computation |
141
click to vote
SOFSEM
2000
Springer
15 years 6 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
106
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
IJIS
2008
15 years 3 months ago
2008
Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computati...
127
click to vote
LKR
2008
15 years 4 months ago
2008
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...
165
click to vote
ETVC
2008
15 years 4 months ago
2008
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...