663 search results - page 78 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
TIP
2010
13 years 6 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
JMLR
2008
13 years 7 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
EOR
2011
13 years 2 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present an approach for the veri cation of spatial properties with Spin. We rst extend one of Spin's main property speci cation mechanisms, i.e., the linear-time...