19320 search results - page 3791 / 3864 » On the complexity of computing determinants |
126
click to vote
STOC
2000
ACM
15 years 2 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
ICML
1999
IEEE
15 years 2 months ago
1999
IEEE
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
SMA
1999
ACM
15 years 2 months ago
1999
ACM
Accurate prediction of the swept volume of a cutting tool is essential in NC verification algorithms for detecting deficiencies in a proposed tool path, such as gouging, undercutt...
107
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
108
click to vote
INFOCOM
1999
IEEE
15 years 2 months ago
1999
IEEE
With the proliferation of high-speed networks and networked services, provisioning differentiated services to a diverse user base with heterogeneous QoS requirements has become an ...