Sciweavers

1034 search results - page 123 / 207
» Small Pi01 Classes
Sort
View
150
Voted
JACM
2000
73views more  JACM 2000»
15 years 3 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo
165
Voted
PRL
2007
154views more  PRL 2007»
15 years 3 months ago
Regularized mixture discriminant analysis
Abstract – In this paper we seek a Gaussian mixture model (GMM) of the classconditional densities for plug-in Bayes classification. We propose a method for setting the number of ...
Zohar Halbe, Mayer Aladjem
129
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...
118
Voted
RSA
2010
107views more  RSA 2010»
15 years 2 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
163
Voted
FSTTCS
2010
Springer
15 years 1 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...