9209 search results - page 294 / 1842 » Data Space Randomization |
159
click to vote
ICANN
2007
Springer
16 years 24 days ago
2007
Springer
In the field of computer vision feature matching in high dimensional feature spaces is a commonly used technique for object recognition. One major problem is to find an adequate s...
199
click to vote
ASWC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Semantics shows diversity in real world, document world, mental abstraction world and machine world. Transformation between semantics pursues the uniformity in the divers...
177
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
194
click to vote
IJCAI
2007
15 years 8 months ago
2007
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
202
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...