Sciweavers

269 search results - page 28 / 54
» Complexity Theory Made Easy
Sort
View
MSR
2011
ACM
12 years 11 months ago
A simpler model of software readability
Software readability is a property that influences how easily a given piece of code can be read and understood. Since readability can affect maintainability, quality, etc., prog...
Daryl Posnett, Abram Hindle, Premkumar T. Devanbu
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 2 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
AAAI
1994
13 years 10 months ago
Incremental Recompilation of Knowledge
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
14 years 9 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
FOCS
2008
IEEE
14 years 3 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...