Sciweavers

681 search results - page 115 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
PODS
1999
ACM
95views Database» more  PODS 1999»
14 years 2 months ago
Minimal Data Upgrading to Prevent Inference and Association
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
Steven Dawson, Sabrina De Capitani di Vimercati, P...
AAAI
2010
13 years 11 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
IJCAI
1993
13 years 11 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
PAMI
2008
189views more  PAMI 2008»
13 years 9 months ago
Detecting Objects of Variable Shape Structure With Hidden State Shape Models
This paper proposes a method for detecting object classes that exhibit variable shape structure in heavily cluttered images. The term "variable shape structure" is used t...
Jingbin Wang, Vassilis Athitsos, Stan Sclaroff, Ma...
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 4 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...