2168 search results - page 203 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
143
click to vote
SADM
2010
14 years 11 months ago
2010
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...
177
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
139
click to vote
SIGMETRICS
2006
ACM
15 years 10 months ago
2006
ACM
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
152
click to vote
FOCI
2007
IEEE
15 years 10 months ago
2007
IEEE
— We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for ...
175
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...