Sciweavers

951 search results - page 17 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
BIRTHDAY
2009
Springer
15 years 5 months ago
No i-Sums for Nissim (and Shalom)
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
Itamar Francez
72
Voted
SAGT
2009
Springer
112views Game Theory» more  SAGT 2009»
15 years 4 months ago
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
WCNC
2008
IEEE
15 years 4 months ago
Analysis of Interference from Large Clusters as Modeled by the Sum of Many Correlated Lognormals
Abstract—We examine the statistical distribution of the interference produced by a cluster of very many co-channel interferers, e.g., a sensor network, or a city full of active w...
Sebastian S. Szyszkowicz, Halim Yanikomeroglu
TSP
2008
151views more  TSP 2008»
14 years 10 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
EACL
2009
ACL Anthology
15 years 10 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith