Sciweavers

2040 search results - page 147 / 408
» Approximate Expectation Maximization
Sort
View
215
Voted
PE
2008
Springer
173views Optimization» more  PE 2008»
15 years 2 months ago
M/G/1 queue with deterministic reneging times
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation ...
Wei Xiong, David L. Jagerman, Tayfur Altiok
BMVC
2010
15 years 1 months ago
Active 3D Segmentation through Fixation of Previously Unseen Objects
We present an approach for active segmentation based on integration of several cues. It serves as a framework for generation of object hypotheses of previously unseen objects in n...
Mårten Björkman, Danica Kragic
302
Voted
ICASSP
2011
IEEE
15 years 24 days ago
Non-flat clustering whith alpha-divergences
The scope of the well-known k-means algorithm has been broadly extended with some recent results: first, the k- means++ initialization method gives some approximation guarantees...
Olivier Schwander, Frank Nielsen
ATAL
2004
Springer
15 years 8 months ago
A Study of Limited-Precision, Incremental Elicitation in Auctions
We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...
Alexander Kress, Craig Boutilier
EUROCRYPT
1999
Springer
15 years 7 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor