Sciweavers

4791 search results - page 60 / 959
» Clustering with partial information
Sort
View
ICONIP
2009
14 years 9 months ago
Quasi-Deterministic Partially Observable Markov Decision Processes
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
Camille Besse, Brahim Chaib-draa
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 12 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 2 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
AIME
2005
Springer
15 years 5 months ago
Towards Information Visualization and Clustering Techniques for MRI Data Sets
Abstract. The paper deals with the integrated use of Information Visualization techniques and clustering algorithms to analyze Magnetic Resonance Imaging (MRI) data sets. The paper...
Umberto Castellani, Carlo Combi, Pasquina Marzola,...
HPCC
2007
Springer
15 years 6 months ago
DISH - Dynamic Information-Based Scalable Hashing on a Cluster of Web Cache Servers
Caching web pages is an important part of web infrastructure. The effects of caching services are even more pronounced for wireless infrastructures due to their limited bandwidth. ...
Andrew Sohn, Hukeun Kwak, Kyusik Chung