Sciweavers

425 search results - page 30 / 85
» On linear sets on a projective line
Sort
View
COLT
2006
Springer
13 years 9 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth
FOCS
2002
IEEE
14 years 24 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
COMGEO
2010
ACM
13 years 8 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
ADCM
2006
110views more  ADCM 2006»
13 years 8 months ago
Interpolation on lattices generated by cubic pencils
: Principal lattices are distributions of points in the plane obtained from a triangle by drawing equidistant parallel lines to the sides and taking the intersection points as node...
Jesús M. Carnicer, Mariano Gasca
AAAI
2007
13 years 10 months ago
Improved State Estimation in Multiagent Settings with Continuous or Large Discrete State Spaces
State estimation in multiagent settings involves updating an agent’s belief over the physical states and the space of other agents’ models. Performance of the previous approac...
Prashant Doshi