Sciweavers

1186 search results - page 16 / 238
» A New Approach to Secure Logging
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
WWW
2007
ACM
14 years 9 months ago
Mining contiguous sequential patterns from web logs
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...
Jinlin Chen, Terry Cook
GLOBECOM
2008
IEEE
14 years 2 months ago
Tight Bounds of the Generalized Marcum Q-Function Based on Log-Concavity
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
Yin Sun, Shidong Zhou
IACR
2011
115views more  IACR 2011»
12 years 8 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky
TSMC
2008
162views more  TSMC 2008»
13 years 8 months ago
A New Model for Secure Dissemination of XML Content
Abstract--The paper proposes an approach to content dissemination that exploits the structural properties of an Extensible Markup Language (XML) document object model in order to p...
Ashish Kundu, Elisa Bertino