493 search results - page 44 / 99 » Alternating Weighted Automata |
ICASSP
2011
IEEE
13 years 13 days ago
2011
IEEE
We consider the blind separation of sources with general (e.g., not necessarily stationary) temporal covariance structures. When the sources’ temporal covariance matrices are kn...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AAAI
2008
13 years 11 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
CHES
2008
Springer
13 years 10 months ago
2008
Springer
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in...
ATVA
2011
Springer
12 years 8 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....