1478 search results - page 59 / 296 » Modular Complexity Analysis via Relative Complexity |
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
This paper investigates the view update problem for XML views published from relational data. We consider (possibly) recursively defined XML views, compressed into DAGs and stored...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
ACSAC
2003
IEEE
14 years 2 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
COLT
2000
Springer
14 years 1 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
ASPLOS
2011
ACM
13 years 18 days ago
2011
ACM
Diagnosing software failures in the field is notoriously difficult, in part due to the fundamental complexity of trouble-shooting any complex software system, but further exacer...