461 search results - page 31 / 93 » Splitting NP-Complete Sets |
COLT
2010
Springer
13 years 9 months ago
2010
Springer
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
GLOBECOM
2006
IEEE
14 years 5 months ago
2006
IEEE
Abstract— We consider communication over the Gaussian multiple access channel (MAC) with unknown set of active users. The proposed multiple access strategy is distributed and ach...
IJCNN
2006
IEEE
14 years 5 months ago
2006
IEEE
—In this paper, we present three different methods for implementing the Probabilistic Neural Network on a Beowulf cluster computer. The three methods, Parallel Full Training Set ...
DAGSTUHL
2007
14 years 12 days ago
2007
The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a very long time. But it began to take on a fresh life i...
DAM
2008
13 years 11 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...