6274 search results - page 576 / 1255 » From query complexity to computational complexity |
173
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
178
click to vote
NOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
174
click to vote
TLCA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
174
click to vote
SKG
2005
IEEE
16 years 21 days ago
2005
IEEE
One of the visions of Grid computing is to access computational resources automatically on demand to deliver the services required with appropriate quality. Because mobile devices ...
179
click to vote
PDCAT
2005
Springer
16 years 18 days ago
2005
Springer
This paper presents a performance study of a nonrigid registration algorithm for investigating lung disease on clusters. Our algorithm combines two conventional acceleration techn...