2173 search results - page 294 / 435 » On the Values of Reducibility Candidates |
195
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
182
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumenta...
218
click to vote
MICRO
2008
IEEE
16 years 26 days ago
2008
IEEE
— As semiconductor processing techniques continue to scale down, transient faults, also known as soft errors, are increasingly becoming a reliability threat to high-performance m...
173
click to vote
EVOW
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
186
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...