3946 search results - page 525 / 790 » The computational complexity of choice sets |
172
Voted
COMPGEOM
2006
ACM
16 years 21 days ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
243
click to vote
KSEM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Ontology mapping is one of the most important tasks for ontology interoperability and its main aim is to find semantic relationships between entities (i.e. concept, attri...
189
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
237
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: As the size of the known human interactome grows, biologists increasingly rely on computational tools to identify patterns that represent protein complexes and pathway...
200
Voted
KR
2010
Springer
15 years 11 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...