Sciweavers

1403 search results - page 51 / 281
» About Approximations of Exponentials
Sort
View
AAAI
2007
15 years 1 months ago
Graph Partitioning Based on Link Distributions
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
NIPS
2008
15 years 17 days ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
89
Voted
IOR
2006
75views more  IOR 2006»
14 years 11 months ago
Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
Ward Whitt
CGF
2004
108views more  CGF 2004»
14 years 11 months ago
Interference Detection for Subdivision Surfaces
Accurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided contro...
Xiaobin Wu, Jörg Peters
PE
2008
Springer
173views Optimization» more  PE 2008»
14 years 10 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