681 search results - page 52 / 137 » General Polynomial Time Decomposition Algorithms |
202
click to vote
GIS
2004
ACM
16 years 1 months ago
2004
ACM
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
CPHYSICS
2010
15 years 18 days ago
2010
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
107
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
94
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
93
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...