Sciweavers

664 search results - page 50 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
TNN
2010
216views Management» more  TNN 2010»
14 years 4 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
SCN
2008
Springer
14 years 9 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 8 days ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 3 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
PAMI
2011
14 years 4 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor