Sciweavers

56 search results - page 8 / 12
» An Empirical Investigation of the K2 Metric
Sort
View
NECO
2010
97views more  NECO 2010»
13 years 6 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
METRICS
2003
IEEE
14 years 28 days ago
Estimating the Design Effort of Web Applications
Our study focuses on the effort needed for designing Web applications. The effort required for the design phase is an important part of the total development effort of a Web appli...
Luciano Baresi, Sandro Morasca, Paolo Paolini
SIGMETRICS
2009
ACM
149views Hardware» more  SIGMETRICS 2009»
14 years 2 months ago
On the treeness of internet latency and bandwidth
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian...
INFOCOM
2007
IEEE
14 years 1 months ago
Measuring Network-Aware Worm Spreading Ability
— This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent worms that exploit such a vuln...
Zesheng Chen, Chuanyi Ji
SIGSOFT
2008
ACM
14 years 8 months ago
Can developer-module networks predict failures?
Software teams should follow a well defined goal and keep their work focused. Work fragmentation is bad for efficiency and quality. In this paper we empirically investigate the re...
Martin Pinzger, Nachiappan Nagappan, Brendan Murph...