2826 search results - page 135 / 566 » Maximal Vector Computation in Large Data Sets |
251
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
143
click to vote
3DPVT
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
121
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
142
click to vote
ESCIENCE
2007
IEEE
15 years 8 months ago
2007
IEEE
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
148
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...