Sciweavers

2027 search results - page 50 / 406
» When is it best to best-respond
Sort
View
AUSAI
2003
Springer
14 years 3 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
MOBICOM
1997
ACM
14 years 1 months ago
Dynamic Network Reconfiguration Support for Mobile Computers
Hot swapping technology combined with pervasive heterogeneous networks empowers mobile laptop users to select the best network device for their current environment. Unfortunately,...
Jon Inouye, Jim Binkley, Jonathan Walpole
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 10 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
ICCV
2007
IEEE
15 years 6 hour ago
Synthetic Aperture Tracking: Tracking through Occlusions
Occlusion is a significant challenge for many tracking algorithms. Most current methods can track through transient occlusion, but cannot handle significant extended occlusion whe...
Neel Joshi, Shai Avidan, Wojciech Matusik, David J...
CF
2006
ACM
14 years 4 months ago
Tile size selection for low-power tile-based architectures
In this paper, we investigate the power implications of tile size selection for tile-based processors. We refer to this investigation as a tile granularity study. This is accompli...
John Oliver, Ravishankar Rao, Michael Brown, Jenni...