556 search results - page 38 / 112 » A Comparative Study of Some Generalized Rough Approximations |
109
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we study the fundamental performance limits of image denoising where the aim is to recover the original image from its noisy observation. Our study is based on a ge...
124
Voted
AAIM
2005
Springer
15 years 7 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
113
click to vote
CANPC
1999
Springer
15 years 6 months ago
1999
Springer
Streamlining communication is key to achieving good performance in shared-memory parallel programs. While full hardware support for cache coherence generally offers the best perfo...
113
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
127
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...