Sciweavers

458 search results - page 63 / 92
» Linear Time Algorithms for Clustering Problems in Any Dimens...
Sort
View
ESA
2010
Springer
197views Algorithms» more  ESA 2010»
13 years 6 months ago
How to Allocate Goods in an Online Market?
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
Yossi Azar, Niv Buchbinder, Kamal Jain
NETWORK
2011
13 years 3 months ago
Inferring video QoE in real time
Inferring the subjective perception of a video stream in real time continues to be a stiff problem. This article presents MintMOS: a lightweight, no-reference, loadable kernel mod...
Mukundan Venkataraman, Mainak Chatterjee
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 8 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 9 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 8 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim