536 search results - page 40 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
SPIRE
2001
Springer
14 years 28 days ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
DATAMINE
2006
13 years 8 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
MMAS
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we introduce a new nonlinear evolution partial differential equation for sparse deconvolution problems. The proposed PDE has the form of continuity equation that ar...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...