10901 search results - page 1827 / 2181 » Approximations in Distributed Optimization |
152
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
151
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
139
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
154
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
259
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...