Sciweavers

2661 search results - page 140 / 533
» Quantum Complexity Classes
Sort
View
DAWAK
2011
Springer
14 years 3 months ago
OLAP Formulations for Supporting Complex Spatial Objects in Data Warehouses
In recent years, there has been a large increase in the amount of spatial data obtained from remote sensing, GPS receivers, communication terminals and other domains. Data warehous...
Ganesh Viswanathan, Markus Schneider
CVPR
2012
IEEE
13 years 5 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
LATA
2010
Springer
15 years 8 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
IANDC
1998
64views more  IANDC 1998»
15 years 3 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
ECCC
2008
79views more  ECCC 2008»
15 years 3 months ago
Valiant-Vazirani Lemmata for Various Logics
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
Moritz Müller