Sciweavers

48 search results - page 9 / 10
» A New Conditioning Rule, Its Generalization and Evidential R...
Sort
View
PAMI
2006
145views more  PAMI 2006»
13 years 8 months ago
Reflectance Sharing: Predicting Appearance from a Sparse Set of Images of a Known Shape
Three-dimensional appearance models consisting of spatially varying reflectance functions defined on a known shape can be used in analysis-by-synthesis approaches to a number of vi...
Todd Zickler, Ravi Ramamoorthi, Sebastian Enrique,...
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 9 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
POPL
2010
ACM
14 years 6 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
14 years 2 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 9 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng