Sciweavers

7129 search results - page 1008 / 1426
» Approximation Algorithms for Treewidth
Sort
View
121
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 4 months ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
CORR
2008
Springer
151views Education» more  CORR 2008»
15 years 4 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 4 months ago
Decentralised Learning MACs for Collision-free Access in WLANs
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
Minyu Fang, David Malone, Ken R. Duffy, Douglas J....
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 4 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
155
Voted
CSDA
2010
208views more  CSDA 2010»
15 years 4 months ago
Bayesian density estimation and model selection using nonparametric hierarchical mixtures
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
Raffaele Argiento, Alessandra Guglielmi, Antonio P...
« Prev « First page 1008 / 1426 Last » Next »