Sciweavers

768 search results - page 67 / 154
» Asymptotic Cellular Complexity
Sort
View
WSC
2007
13 years 10 months ago
Efficient suboptimal rare-event simulation
Much of the rare-event simulation literature is concerned with the development of asymptotically optimal algorithms. Because of the difficulties associated with applying these id...
Xiaowei Zhang, Jose Blanchet, Peter W. Glynn
CCCG
2008
13 years 9 months ago
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
Jérémy Barbay, Eric Y. Chen
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 8 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm
IPL
2007
100views more  IPL 2007»
13 years 7 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li
ADCM
2004
58views more  ADCM 2004»
13 years 7 months ago
On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
Hrushikesh Narhar Mhaskar, Francis J. Narcowich, J...