417 search results - page 68 / 84 » Some Theory for Generalized Boosting Algorithms |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
DIALM
2007
ACM
13 years 11 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
DIALM
2003
ACM
14 years 1 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...