Sciweavers

886 search results - page 74 / 178
» Generalized Bezout Identity
Sort
View
UAI
2003
13 years 10 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ICIS
2000
13 years 10 months ago
Economic mechanism design for securing online auctions
Enhancing e-commerce security through computing technology alone is not sufficient. E-commerce designers should apply economic mechanisms to design proper digital processes that a...
Wenli Wang, Zoltán Hidvégi, Andrew B...
SIROCCO
1998
13 years 10 months ago
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
Stefan Dobrev, Peter Ruzicka, Gerard Tel
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Arithmetic circuits: the chasm at depth four gets wider
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
Pascal Koiran
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 9 months ago
On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
Chandra Nair, Zizhou Vincent Wang