1042 search results - page 30 / 209 » Failing First: An Update |
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Online Boosting is an effective incremental learning method which can update weak classifiers efficiently according to the object being trackedt. It is a promising technique for o...
HICSS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we present Captain Cook, a service that continuously monitors resources in the Internet, and allows clients to locate resources using this information. Captain Cook ...
COMSWARE
2007
IEEE
15 years 1 months ago
2007
IEEE
Software deployment and updating of deployed code is a critical topic in the area of wireless sensor networks (WSN). Reasons are unreliable network connectivity, resource limitatio...
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...