Sciweavers

16404 search results - page 2554 / 3281
» A set coverage problem
Sort
View
TSD
2007
Springer
16 years 1 months ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
UIC
2007
Springer
16 years 1 months ago
Context-Aware Service Composition for Mobile Network Environments
Recent advances in wireless and mobile networking technology pose a new set of requirements and challenges that are not previously thought of, when it comes to smart space middlewa...
Choonhwa Lee, Sunghoon Ko, Seungjae Lee, Wonjun Le...
UM
2007
Springer
16 years 1 months ago
Feature-Weighted User Model for Recommender Systems
Recommender systems are gaining widespread acceptance in e-commerce applications to confront the “information overload” problem. Collaborative Filtering (CF) is a successful re...
Panagiotis Symeonidis, Alexandros Nanopoulos, Yann...
189
Voted
VLDB
2007
ACM
138views Database» more  VLDB 2007»
16 years 1 months ago
Minimality Attack in Privacy Preserving Data Publishing
Data publishing generates much concern over the protection of individual privacy. In the well-known kanonymity model and the related models such as l-diversity and (α, k)-anonymi...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, J...
VLDB
2007
ACM
105views Database» more  VLDB 2007»
16 years 1 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
« Prev « First page 2554 / 3281 Last » Next »