Sciweavers

166 search results - page 4 / 34
» Tighter Bounds for Structured Estimation
Sort
View
GRAPHICSINTERFACE
2003
13 years 6 months ago
Easy Realignment of k-DOP Bounding Volumes
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is eq...
Christoph Fünfzig, Dieter W. Fellner
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
13 years 10 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
ICML
2007
IEEE
14 years 5 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 2 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
TSP
2010
12 years 11 months ago
Blind separation of Gaussian sources with general covariance structures: bounds and optimal estimation
Abstract--We consider the separation of Gaussian sources exhibiting general, arbitrary (not necessarily stationary) covariance structures. First, assuming a semi-blind scenario, in...
Arie Yeredor