Sciweavers

1449 search results - page 55 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
DAM
2006
81views more  DAM 2006»
15 years 17 days ago
Equivalence-free exhaustive generation of matroid representations
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
Petr Hlinený
IJON
2006
127views more  IJON 2006»
15 years 16 days ago
Sparse ICA via cluster-wise PCA
In this paper, it is shown that Independent Component Analysis (ICA) of sparse signals (sparse ICA) can be seen as a cluster-wise Principal Component Analysis (PCA). Consequently,...
Massoud Babaie-Zadeh, Christian Jutten, Ali Mansou...
ICASSP
2011
IEEE
14 years 4 months ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer
85
Voted
DEXA
2008
Springer
87views Database» more  DEXA 2008»
15 years 2 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...
102
Voted
AAAI
2006
15 years 1 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche