Sciweavers

303 search results - page 60 / 61
» ROAR: increasing the flexibility and performance of distribu...
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
CIKM
2009
Springer
14 years 2 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
SIGIR
2009
ACM
14 years 2 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...
COLCOM
2008
IEEE
14 years 2 months ago
Replication in Overlay Networks: A Multi-objective Optimization Approach
Recently, overlay network-based collaborative applications such as instant messaging, content sharing, and Internet telephony are becoming increasingly popular. Many of these appli...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...
VLDB
2005
ACM
90views Database» more  VLDB 2005»
14 years 1 months ago
Tuning Schema Matching Software using Synthetic Scenarios
Most recent schema matching systems assemble multiple components, each employing a particular matching technique. The domain user must then tune the system: select the right compo...
Mayssam Sayyadian, Yoonkyong Lee, AnHai Doan, Arno...