223 search results - page 31 / 45 » Proving Termination by Bounded Increase |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
100
click to vote
ICANN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
LOGCOM
2006
14 years 9 months ago
2006
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
62
Voted
FOCM
2010
14 years 8 months ago
2010
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
ISITA
2010
14 years 7 months ago
2010
Network coding was proposed to increase the achievable throughput of multicast in a network. Recently, combining network coding into user cooperation has attracted research attenti...