Sciweavers

1520 search results - page 17 / 304
» Class Hierarchy Specialization
Sort
View
CCCG
2006
13 years 9 months ago
Local Overlaps In Special Unfoldings Of Convex Polyhedra
We define a notion of local overlaps in polyhedron unfoldings. We use this concept to construct convex polyhedra for which certain classes of edge unfoldings contain overlaps, the...
Brendan Lucier
CVPR
2010
IEEE
14 years 4 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 8 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
CORR
1999
Springer
65views Education» more  CORR 1999»
13 years 7 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
PLDI
1995
ACM
13 years 11 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove