Sciweavers

207 search results - page 20 / 42
» The Polynomial Method for Random Matrices
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
DAC
2008
ACM
14 years 9 months ago
The synthesis of robust polynomial arithmetic with stochastic logic
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
Weikang Qian, Marc D. Riedel
JCB
2006
91views more  JCB 2006»
13 years 8 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
14 years 2 months ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 8 months ago
Vector Precoding for Wireless MIMO Systems: A Replica Analysis
We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...