844 search results - page 67 / 169 » Solving the p |
DLT
2004
14 years 11 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
ECCC
2010
14 years 10 months ago
2010
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization r...
112
click to vote
NC
2011
14 years 4 months ago
2011
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...