1243 search results - page 110 / 249 » On the locality of bounded growth |
255
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
177
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
The phenomenal growth of the world-wide web has made it the most popular Internet application today. Web caching and content distribution services have been recognized as valuable...
168
click to vote
ASAP
2010
IEEE
15 years 8 months ago
2010
IEEE
Recent research has proposed security-critical real-time embedded systems with provably-strong information containment through the use of hardware-enforced execution leases. Execut...
146
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
142
click to vote
AAAI
2006
15 years 7 months ago
2006
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...