Sciweavers

809 search results - page 69 / 162
» Similarity, topology, and uniformity
Sort
View
DCG
2000
76views more  DCG 2000»
14 years 10 months ago
A Central Limit Theorem for Convex Chains in the Square
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
Imre Bárány, Günter Rote, Willi...
ECCC
2000
93views more  ECCC 2000»
14 years 10 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
NA
2007
118views more  NA 2007»
14 years 10 months ago
Extrapolation methods for approximating arc length and surface area
A well-known method of estimating the length of a parametric curve in Rd is to sample some points from it and compute the length of the polygon passing through them. In this paper...
Michael S. Floater, Atgeirr F. Rasmussen, Ulrich R...
RSA
2008
80views more  RSA 2008»
14 years 10 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
TCS
2010
14 years 9 months ago
On the expressiveness of interaction
Subbisimilarity is proposed as a general tool to classify the relative expressive power of process calculi. The expressiveness of several variants of CCS is compared in terms of t...
Yuxi Fu, Hao Lu