Sciweavers

2095 search results - page 252 / 419
» Improved pebbling bounds
Sort
View
FMCAD
2008
Springer
15 years 8 months ago
Verifying an Arbiter Circuit
Abstract--This paper presents the verification of an asynchronous arbiter modeled at the circuit level with non-linear ordinary differential equations. We use Brockett's annul...
Chao Yan, Mark R. Greenstreet
CATS
2007
15 years 8 months ago
On the Power of Structural Violations in Priority Queues
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
DAGSTUHL
2007
15 years 8 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin
NIPS
2007
15 years 8 months ago
Collapsed Variational Inference for HDP
A wide variety of Dirichlet-multinomial ‘topic’ models have found interesting applications in recent years. While Gibbs sampling remains an important method of inference in su...
Yee Whye Teh, Kenichi Kurihara, Max Welling
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 8 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari