Sciweavers

1439 search results - page 135 / 288
» Fast approximation of centrality
Sort
View
118
Voted
TVCG
2011
175views more  TVCG 2011»
14 years 7 months ago
Parallel Iteration to the Radiative Transport in Inhomogeneous Media with Bootstrapping
—This paper presents a fast parallel method to solve the radiative transport equation in inhomogeneous participating media. We apply a novel approximation scheme to find a good ...
László Szirmay-Kalos, Gabor Liktor, ...
97
Voted
JC
2010
117views more  JC 2010»
14 years 7 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
15 years 7 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
ICNP
2007
IEEE
15 years 7 months ago
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
Zongheng Zhou, Himanshu Gupta, Samir R. Das, Xianj...
CSCLP
2007
Springer
15 years 7 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...