27354 search results - page 5466 / 5471 » Distributed And Parallel Computing |
118
click to vote
SODA
2012
ACM
13 years 11 hour ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
117
click to vote
SIGMETRICS
2012
ACM
13 years 4 hour ago
2012
ACM
Energy efficiency and power capping remain growing concerns in server systems. Online applications continue to evolve with new features and dynamic clientdirected processing, res...
116
click to vote
TKDE
2012
12 years 12 months ago
2012
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
105
click to vote
SDM
2012
SIAM
12 years 12 months ago
2012
SIAM
: Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
105
click to vote
SIAMCOMP
2012
12 years 12 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...