597 search results - page 13 / 120 » Dominating Distributions and Learnability |
118
click to vote
JMLR
2010
14 years 7 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
92
Voted
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
122
Voted
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
132
click to vote
MOBIHOC
2002
ACM
16 years 6 days ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
97
Voted
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, im...