Sciweavers

15073 search results - page 24 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
New results on adaptive computational resource allocation in soft MIMO detection
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
Mirsad Cirkic, Daniel Persson, Erik G. Larsson
GEOS
2007
Springer
15 years 3 months ago
Modeling Spatio-temporal Network Computations: A Summary of Results
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of...
Betsy George, Shashi Shekhar
66
Voted
CG
2006
Springer
15 years 1 months ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
15 years 3 months ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
15 years 9 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch