5922 search results - page 897 / 1185 » Navigability of Complex Networks |
174
click to vote
ICANN
2003
Springer
16 years 14 days ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
187
click to vote
IPTPS
2003
Springer
16 years 13 days ago
2003
Springer
This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding imp...
222
click to vote
DEXAW
2002
IEEE
16 years 6 days ago
2002
IEEE
One characteristic of the next generation wireless mobile environments is a high level of interoperability between mobile applications and services. This imposes significant dema...
199
click to vote
STOC
2010
ACM
16 years 2 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
176
click to vote
MLDM
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper proposes a general local learning framework to effectively alleviate the complexities of classifier design by means of “divide and conquer” principle and ...