Sciweavers

204 search results - page 8 / 41
» A Half-Million Strong at Least
Sort
View
ICCCN
1998
IEEE
15 years 1 months ago
On the Vulnerabilities and Protection of OSPF Routing Protocol
This paper analyzes both the strong points and weak points of OSPF routing protocol from security perspective. On its strong points, we abstract its features of information least ...
Feiyi Wang, Shyhtsun Felix Wu
AOIS
2004
14 years 11 months ago
Agents as Catalysts for Mobile Computing
Agent-Oriented Programming (AOP) offers an alternative and radical approach to the development of information systems in various domains. However, one domain that AOP has only mini...
Gregory M. P. O'Hare, Michael J. O'Grady, Rem W. C...
JCT
2007
85views more  JCT 2007»
14 years 9 months ago
Separating systems and oriented graphs of diameter two
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
Béla Bollobás, Alex D. Scott
CORR
2008
Springer
143views Education» more  CORR 2008»
14 years 9 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
SIAMJO
2011
14 years 4 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye