255 search results - page 46 / 51 » A new upper bound for the bipartite Ramsey problem |
99
Voted
TIP
2008
14 years 11 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
86
Voted
TPDS
1998
14 years 11 months ago
1998
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...
115
Voted
JCAM
2010
14 years 6 months ago
2010
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
102
click to vote
AIPS
2006
15 years 1 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
106
click to vote
STOC
2004
ACM
15 years 12 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...