421 search results - page 53 / 85 » Computing a k -Route over Uncertain Geographical Data |
167
click to vote
CIKM
2006
Springer
15 years 7 months 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...
141
click to vote
NIPS
2001
15 years 7 months ago
2001
We investigate the following data mining problem from Computational Chemistry: From a large data set of compounds, find those that bind to a target molecule in as few iterations o...
158
click to vote
DRM
2003
Springer
15 years 11 months ago
2003
Springer
Agrawal and Kiernan’s watermarking technique for database relations [1] and Li et al’s fingerprinting extension [6] both depend critically on primary key attributes. Hence, t...
172
click to vote
PROPERTYTESTING
2010
15 years 3 months ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
165
click to vote
IPPS
2007
IEEE
15 years 12 months ago
2007
IEEE
Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion are notoriously difficult to parallelize efficient...