Sciweavers

561 search results - page 34 / 113
» Using number fields to compute logarithms in finite fields
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 9 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
JMLR
2008
230views more  JMLR 2008»
13 years 8 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 9 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
13 years 8 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
DCC
2002
IEEE
14 years 8 months ago
Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...
Peng Ding, Jennifer D. Key