5100 search results - page 599 / 1020 » The Linear Complexity of a Graph |
187
click to vote
WDAG
2005
Springer
16 years 7 days ago
2005
Springer
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
197
click to vote
COLT
1995
Springer
15 years 10 months ago
1995
Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
175
click to vote
COR
2010
15 years 6 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
179
click to vote
JNW
2006
15 years 6 months ago
2006
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
283
click to vote
DC
2011
14 years 6 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...