Sciweavers

215 search results - page 21 / 43
» Indeterminacy and Rough Approximation
Sort
View
CGF
2011
13 years 6 days ago
BSSRDF Estimation from Single Images
We present a novel method to estimate an approximation of the reflectance characteristics of optically thick, homogeneous translucent materials using only a single photograph as ...
Adolfo Muñoz, Jose I. Echevarria, Francisco...
WWW
2007
ACM
14 years 9 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
FOCS
1995
IEEE
14 years 5 days ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 21 days ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
RANDOM
1998
Springer
14 years 25 days ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang