Sciweavers

327 search results - page 16 / 66
» A Theory of Information-Flow Labels
Sort
View
CI
2004
76views more  CI 2004»
15 years 5 months ago
Negotiating Exchanges of P3p-Labeled Information for Compensation
We consider private information a commodity, of value to both the information holder and the information seeker. Hence, a customer can be enticed to trade his/her private informati...
Scott Buffett, Keping Jia, Sandy Liu, Bruce Spence...
PAMI
2007
176views more  PAMI 2007»
15 years 5 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
CVPR
2012
IEEE
13 years 8 months ago
Graph cuts optimization for multi-limb human segmentation in depth maps
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps...
Antonio Hernández-Vela, Nadezhda Zlateva, A...
IAT
2009
IEEE
15 years 9 months ago
On the Acceptability of Meta-arguments
In this paper we introduce a theory of meta-argumentation, by using Dung’s theory of abstract argumentation to reason about itself. Metaarguments are generated from atomic argum...
Guido Boella, Leendert van der Torre, Serena Villa...
POPL
2006
ACM
16 years 6 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands