Sciweavers

3708 search results - page 647 / 742
» Approximating Betweenness Centrality
Sort
View
PKDD
2010
Springer
124views Data Mining» more  PKDD 2010»
13 years 9 months ago
Summarising Data by Clustering Items
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...
Michael Mampaey, Jilles Vreeken
PVLDB
2010
107views more  PVLDB 2010»
13 years 9 months ago
On Multi-Column Foreign Key Discovery
A foreign/primary key relationship between relational tables is one of the most important constraints in a database. From a data analysis perspective, discovering foreign keys is ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...
SPIRE
2010
Springer
13 years 9 months ago
Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...
Yoram Bachrach, Ralf Herbrich
SPIRE
2010
Springer
13 years 9 months ago
Restricted LCS
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe...
TCS
2010
13 years 9 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer