Sciweavers

1772 search results - page 119 / 355
» Classifying Problems into Complexity Classes
Sort
View
FORMATS
2008
Springer
15 years 8 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
CORR
2011
Springer
193views Education» more  CORR 2011»
15 years 1 months ago
On the regularity of iterated hairpin completion of a single word
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
ISCIS
2004
Springer
15 years 11 months ago
A Study on Answering a Data Mining Query Using a Materialized View
One of the classic data mining problems is discovery of frequent itemsets. This problem particularly attracts database community as it resembles traditional database querying. In t...
Maciej Zakrzewicz, Mikolaj Morzy, Marek Wojciechow...
ICDAR
2009
IEEE
16 years 1 months ago
Unsupervised Selection and Discriminative Estimation of Orthogonal Gaussian Mixture Models for Handwritten Digit Recognition
The problem of determining the appropriate number of components is important in finite mixture modeling for pattern classification. This paper considers the application of an unsu...
Xuefeng Chen, Xiabi Liu, Yunde Jia