1444 search results - page 219 / 289 » On Variations of Power Iteration |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
ISSRE
2007
IEEE
13 years 9 months ago
2007
IEEE
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
IJCAI
2007
13 years 9 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
UAI
2008
13 years 9 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
VIIP
2001
13 years 9 months ago
2001
Graphics cards exercise increasingly more computing power and are highly optimized for high data transfer volumes. In contrast typical workstations perform badly when data exceeds...