3630 search results - page 707 / 726 » Fast Marching Methods |
CIKM
2006
Springer
14 years 13 hour ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
CRV
2005
IEEE
14 years 8 hour ago
2005
IEEE
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
DAGSTUHL
2010
13 years 11 months ago
2010
We apply Knoll et al.'s algorithm [9] to interactively ray-cast constructive solid geometry (CSG) objects of arbitrary primitives represented as implicit functions. Whereas m...
DMIN
2008
13 years 11 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
SDM
2010
SIAM
13 years 11 months ago
2010
SIAM
We apply statistical relational learning to a database of criminal and terrorist activity to predict attributes and event outcomes. The database stems from a collection of news ar...