9209 search results - page 1487 / 1842 » Data Space Randomization |
192
click to vote
JMLR
2010
15 years 4 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
175
click to vote
MICS
2010
15 years 4 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
163
click to vote
PERCOM
2010
ACM
15 years 4 months ago
2010
ACM
—In the environments where heterogeneous devices need to share information, utilize services of each other, and participate as components in various smart applications, it is com...
186
click to vote
PVLDB
2010
15 years 4 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
152
click to vote
SISAP
2010
IEEE
15 years 4 months ago
2010
IEEE
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...