Sciweavers

9631 search results - page 217 / 1927
» The Costs of Using JXTA
Sort
View
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 7 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
FOCS
2006
IEEE
16 years 22 days ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
ECIS
2003
15 years 8 months ago
An architecture model for supporting application integration decisions
For a successful information systems architecture management, reference models and decision rules must be provided. In this paper, an architecture model and design rules are propo...
Robert Winter
ADHOC
2007
115views more  ADHOC 2007»
15 years 6 months ago
Modeling adaptive node capture attacks in multi-hop wireless networks
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...
Patrick Tague, Radha Poovendran
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 6 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman