Sciweavers

1380 search results - page 69 / 276
» A General Polynomial Sieve
Sort
View
JAT
2010
70views more  JAT 2010»
13 years 7 months ago
Density of eigenvalues and its perturbation invariance in unitary ensembles of random matrices
We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomi...
Dang-Zheng Liu, Zheng-Dong Wang, Kui-Hua Yan
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 6 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
MOC
2000
77views more  MOC 2000»
13 years 8 months ago
Locking-free finite elements for the Reissner-Mindlin plate
Two new families of Reissner-Mindlin triangular finite elements are analyzed. One family, generalizing an element proposed by Zienkiewicz and Lefebvre, approximates (for k 1) the ...
Richard S. Falk, Tong Tu
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 3 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
COLT
1993
Springer
14 years 26 days ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum