1872 search results - page 240 / 375 » The Art of Granular Computing |
138
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
167
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
199
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
178
click to vote
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...
192
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...