1236 search results - page 67 / 248 » Prefix-Like Complexities and Computability in the Limit |
102
click to vote
TSP
2010
14 years 4 months ago
2010
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
AINA
2006
IEEE
15 years 3 months ago
2006
IEEE
Pervasive computing is becoming a reality, thanks to advances in wireless networking and increased popularity of portable devices. Users of these devices will need support to deci...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
CVPR
2006
IEEE
15 years 12 months ago
2006
IEEE
With the growing interest in object categorization various methods have emerged that perform well in this challenging task, yet are inherently limited to only a moderate number of...