Sciweavers

1005 search results - page 196 / 201
» Privacy Preserving Clustering
Sort
View
83
Voted
EAAI
2007
154views more  EAAI 2007»
14 years 9 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
ICDM
2010
IEEE
125views Data Mining» more  ICDM 2010»
14 years 7 months ago
Topic Modeling Ensembles
: Topic Modeling Ensembles Zhiyong Shen, Ping Luo, Shengwen Yang, Xukun Shen HP Laboratories HPL-2010-158 Topic model, Ensemble In this paper we propose a framework of topic model...
Zhiyong Shen, Ping Luo, Shengwen Yang, Xukun Shen
TIT
2010
138views Education» more  TIT 2010»
14 years 4 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
MDM
2010
Springer
281views Communications» more  MDM 2010»
14 years 11 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...
IACR
2011
111views more  IACR 2011»
13 years 9 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...