Sciweavers

5595 search results - page 1072 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
121
Voted
TON
2002
86views more  TON 2002»
15 years 2 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
124
Voted
TROB
2008
154views more  TROB 2008»
15 years 1 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
169
Voted
ICDM
2010
IEEE
264views Data Mining» more  ICDM 2010»
15 years 18 days ago
Block-GP: Scalable Gaussian Process Regression for Multimodal Data
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
Kamalika Das, Ashok N. Srivastava
153
Voted
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
14 years 5 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
158
Voted
ICCV
2011
IEEE
14 years 2 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
« Prev « First page 1072 / 1119 Last » Next »