5331 search results - page 871 / 1067 » Algebraic Methods for Optimization Problems |
110
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
105
click to vote
DAS
2010
Springer
15 years 6 months ago
2010
Springer
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
141
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
112
click to vote
AAAI
2006
15 years 3 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
108
click to vote
ICVGIP
2004
15 years 3 months ago
2004
We develop a novel method for fitting high-resolution template meshes to detailed human body range scans with sparse 3D markers. We formulate an optimization problem in which the ...