Sciweavers

7758 search results - page 370 / 1552
» On the Number of Distributive Lattices
Sort
View
ICDCN
2011
Springer
14 years 10 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan
CVPR
2008
IEEE
16 years 8 months ago
Learning stick-figure models using nonparametric Bayesian priors over trees
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
Edward Meeds, David A. Ross, Richard S. Zemel, Sam...
IPPS
2007
IEEE
16 years 1 months ago
On Achieving the Shortest-Path Routing in 2-D Meshes
In this paper, we present a fully distributed process to collect and distribute the minimal connected component (MCC) fault information so that the shortest-path between a source ...
Zhen Jiang, Jie Wu
PDP
2007
IEEE
16 years 1 months ago
A Self-Aware Clock for Pervasive Computing Systems
The paper addresses the challenges and opportunities of instrumenting pervasive computing systems with a logical clock, aware of the quality of synchronization with respect to a t...
Andrea Bondavalli, Andrea Ceccarelli, Lorenzo Fala...
GECCO
2005
Springer
16 years 9 days ago
A theoretical analysis of the HIFF problem
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
Nicholas Freitag McPhee, Ellery Fussell Crane