Sciweavers

538 search results - page 90 / 108
» Dimension induced clustering
Sort
View
ICALP
2011
Springer
13 years 1 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
WWW
2008
ACM
14 years 10 months ago
Modeling online reviews with multi-grain topic models
In this paper we present a novel framework for extracting the ratable aspects of objects from online user reviews. Extracting such aspects is an important challenge in automatical...
Ivan Titov, Ryan T. McDonald
RECOMB
2002
Springer
14 years 10 months ago
Discovering local structure in gene expression data: the order-preserving submatrix problem
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Y...
ADC
2007
Springer
145views Database» more  ADC 2007»
14 years 4 months ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro
IPPS
2005
IEEE
14 years 3 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch