Sciweavers

1511 search results - page 104 / 303
» Randomness, lowness and degrees
Sort
View
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
GD
2004
Springer
15 years 11 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
CRYPTO
2001
Springer
116views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Nonlinear Vector Resilient Functions
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...
Jung Hee Cheon
CAAN
2004
Springer
15 years 11 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
COGSCI
2010
108views more  COGSCI 2010»
15 years 6 months ago
Do Grammars Minimize Dependency Length?
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
Daniel Gildea, David Temperley