256 search results - page 4 / 52 » Separation of NP-Completeness Notions |
COLT
2008
Springer
13 years 8 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
ENTCS
2007
13 years 6 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
LICS
2006
IEEE
14 years 8 days ago
2006
IEEE
A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by conc...
ACL
1998
13 years 7 months ago
1998
This paper proposes decoupling the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a word...