Sciweavers

1059 search results - page 65 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
FOCS
1995
IEEE
15 years 1 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ICC
2007
IEEE
161views Communications» more  ICC 2007»
15 years 4 months ago
Optimizing Multiplayer Gaming Protocols for Heterogeneous Network Environment
— The paper is concerned with a novel adaptive game server protocol optimization to combat network latencies in the case of heterogeneous network environment. In this way, game p...
Zsolt Kenesi, Gábor Kiss, János Leve...
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
14 years 8 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
ICASSP
2011
IEEE
14 years 1 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...