Sciweavers

1128 search results - page 95 / 226
» Classical Natural Deduction
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 7 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ICEIS
2005
IEEE
14 years 3 months ago
Conditions for Interoperability
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
B. Nick Rossiter, Michael A. Heather
NIPS
2004
13 years 11 months ago
Implicit Wiener Series for Higher-Order Image Analysis
The computation of classical higher-order statistics such as higher-order moments or spectra is difficult for images due to the huge number of terms to be estimated and interprete...
Matthias O. Franz, Bernhard Schölkopf
PAMI
2010
203views more  PAMI 2010»
13 years 8 months ago
Visual Word Ambiguity
— This paper studies automatic image classification by modeling soft-assignment in the popular codebook model. The codebook model describes an image as a bag of discrete visual ...
Jan van Gemert, Cor J. Veenman, Arnold W. M. Smeul...
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
14 years 4 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan