3625 search results - page 167 / 725 » On choosing |
177
click to vote
PAKDD
2010
ACM
15 years 12 months ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
184
click to vote
CDC
2009
IEEE
15 years 12 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
197
click to vote
CDC
2009
IEEE
15 years 12 months ago
2009
IEEE
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
184
click to vote
CDC
2009
IEEE
15 years 12 months ago
2009
IEEE
— This paper addresses the exact transformation of nonlinear systems into a multiple model form with unmeasurable premise variables. The multiple model structure serves to treat ...
172
click to vote
CHI
2009
ACM
15 years 12 months ago
2009
ACM
Ninja cursors aim to speed up target selection on large or multiple monitors. Several cursors are displayed on the screen with one of them selected as the active cursor. Eye track...