Sciweavers

243 search results - page 8 / 49
» Linear Network Codes and Systems of Polynomial Equations
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
14 years 11 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
INFOCOM
2008
IEEE
15 years 6 months ago
AdapCode: Adaptive Network Coding for Code Updates in Wireless Sensor Networks
—Code updates, such as those for debugging purposes, are frequent and expensive in the early development stages of wireless sensor network applications. We propose AdapCode, a re...
I-Hong Hou, Yu-En Tsai, Tarek F. Abdelzaher, Indra...
CDC
2008
IEEE
140views Control Systems» more  CDC 2008»
15 years 6 months ago
Model discrimination of polynomial systems via stochastic inputs
— Systems biologists are often faced with competing models for a given experimental system. Unfortunately, performing experiments can be time-consuming and expensive. Therefore, ...
Daniel Georgiev, Eric Klavins
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
15 years 5 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...
CSCLP
2007
Springer
15 years 6 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth