Sciweavers

26 search results - page 3 / 6
» Computing Discrete Logarithms in Quadratic Orders
Sort
View
JCB
2006
91views more  JCB 2006»
13 years 10 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
ISIPTA
2005
IEEE
117views Mathematics» more  ISIPTA 2005»
14 years 4 months ago
On the Existence of Extremal Cones and Comparative Probability Orderings
We study the recently discovered phenomenon [1] of existence of comparative probability orderings on finite sets that violate Fishburn hypothesis [2, 3] — we call such ordering...
Simon Marshall
CVPR
2010
IEEE
14 years 7 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 4 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
SCALESPACE
2005
Springer
14 years 4 months ago
Relations Between Higher Order TV Regularization and Support Vector Regression
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...
Gabriele Steidl, Stephan Didas, Julia Neumann