Sciweavers

1399 search results - page 66 / 280
» New Algorithms for k-Center and Extensions
Sort
View
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
13 years 10 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
ISPA
2004
Springer
14 years 2 months ago
Location-Dependent Query Results Retrieval in a Multi-cell Wireless Environment
The demand of information services is popular in recent years. However, the requested of correct answer in a mobile environment needs to have more attentions. This is due to the sc...
James Jayaputera, David Taniar
CVPR
2007
IEEE
14 years 11 months ago
Variational Bayes Based Approach to Robust Subspace Learning
This paper presents a new algorithm for the problem of robust subspace learning (RSL), i.e., the estimation of linear subspace parameters from a set of data points in the presence...
Takayuki Okatani, Koichiro Deguchi
WOSP
2004
ACM
14 years 2 months ago
Using locality of reference to improve performance of peer-to-peer applications
Peer-to-peer, or simply P2P, systems have recently emerged as a popular paradigm for building distributed applications. One key aspect of the P2P system design is the mechanism us...
Marcelo Werneck Barbosa, Melissa Morgado Costa, Ju...
ICCAD
2005
IEEE
141views Hardware» more  ICCAD 2005»
14 years 6 months ago
Architecture and compilation for data bandwidth improvement in configurable embedded processors
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of applications. While steady progress has been made in t...
Jason Cong, Guoling Han, Zhiru Zhang