2168 search results - page 75 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
130
Voted
CGF
2002
15 years 3 months ago
2002
We extend the standard solution to comic rendering with a comic-style specular component. To minimise the computational overhead associated with this extension, we introduce two o...
145
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
138
Voted
CLUSTER
2009
IEEE
15 years 1 months ago
2009
IEEE
GPUs have recently evolved into very fast parallel co-processors capable of executing general purpose computations extremely efficiently. At the same time, multi-core CPUs evolutio...
128
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
111
click to vote
PE
2006
Springer
15 years 3 months ago
2006
Springer
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...