Sciweavers

1058 search results - page 27 / 212
» It's Doomed; We Can Prove It
Sort
View
CPC
2008
66views more  CPC 2008»
13 years 10 months ago
B2[ g] Sets and a Conjecture of Schinzel and Schmidt
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
Javier Cilleruelo, Carlos Vinuesa
CORR
2007
Springer
137views Education» more  CORR 2007»
13 years 9 months ago
Bounds on the Network Coding Capacity for Wireless Random Networks
— Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic mode...
Salah A. Aly, Vishal Kapoor, Jie Meng, Andreas Kla...
LICS
2012
IEEE
12 years 8 days ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
IJCV
2010
135views more  IJCV 2010»
13 years 8 months ago
On the Apparent Transparency of a Motion Blurred Object
An object which moves during the exposure time results in a blurred smear in the image. We consider the smear as if it was the image of a semitransparent object, and we retrieve i...
Vincenzo Caglioti, Alessandro Giusti
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 10 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett