Sciweavers

1257 search results - page 167 / 252
» A generalization of Euler's constant
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 10 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ISSRE
2007
IEEE
13 years 10 months ago
Data Mining Techniques for Building Fault-proneness Models in Telecom Java Software
This paper describes a study performed in an industrial setting that attempts to build predictive models to identify parts of a Java system with a high probability of fault. The s...
Erik Arisholm, Lionel C. Briand, Magnus Fuglerud
BIS
2007
144views Business» more  BIS 2007»
13 years 10 months ago
Automated Integration Tests for Mobile Applications in Java 2 Micro Edition
Applications written for mobile devices have become more and more complex, adjusting to the constantly improving computational power of hardware. With the growing application size ...
Dawid Weiss, Marcin Zduniak
CIDR
2007
165views Algorithms» more  CIDR 2007»
13 years 10 months ago
A Black-Box Approach to Query Cardinality Estimation
We present a “black-box” approach to estimating query cardinality that has no knowledge of query execution plans and data distribution, yet provides accurate estimates. It doe...
Tanu Malik, Randal C. Burns, Nitesh V. Chawla
DAGSTUHL
2007
13 years 10 months ago
Uniqueness of Optimal Mod 3 Circuits for Parity
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
Frederic Green, Amitabha Roy