Sciweavers

2661 search results - page 197 / 533
» Quantum Complexity Classes
Sort
View
COLT
2005
Springer
16 years 2 days ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth
GD
2005
Springer
16 years 2 days ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
CSL
2004
Springer
15 years 12 months ago
Subtyping Union Types
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
Jerome Vouillon
APSEC
1999
IEEE
15 years 11 months ago
Enhancing Object-Based System Composition through Per-Object Mixins
The management of complexity in large systems is traditionally focused on the modeling and management of classes and hierarchies of classes. In order to improve the compositional ...
Gustaf Neumann, Uwe Zdun
COLT
1999
Springer
15 years 10 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...