35 search results - page 6 / 7 » When crossings count - approximating the minimum spanning tr... |
ETRA
2010
ACM
13 years 6 months ago
2010
ACM
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
CORR
2010
Springer
13 years 22 days ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
FIMI
2003
13 years 7 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
IROS
2007
IEEE
14 years 2 days ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...