Sciweavers

421 search results - page 53 / 85
» Computing a k -Route over Uncertain Geographical Data
Sort
View
CIKM
2006
Springer
13 years 10 months ago
Efficiently clustering transactional data with weighted coverage density
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...
Hua Yan, Keke Chen, Ling Liu
NIPS
2001
13 years 10 months ago
Active Learning in the Drug Discovery Process
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...
Manfred K. Warmuth, Gunnar Rätsch, Michael Ma...
DRM
2003
Springer
14 years 2 months ago
Constructing a virtual primary key for fingerprinting relational data
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...
Yingjiu Li, Vipin Swarup, Sushil Jajodia
PROPERTYTESTING
2010
13 years 6 months ago
Transitive-Closure Spanners: A Survey
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 ...
Sofya Raskhodnikova
IPPS
2007
IEEE
14 years 3 months ago
A Heterogeneous Lightweight Multithreaded Architecture
Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion are notoriously difficult to parallelize efficient...
Sheng Li, Amit Kashyap, Shannon K. Kuntz, Jay B. B...