Sciweavers

330 search results - page 41 / 66
» Intersection and Union Types
Sort
View
SEBD
2007
121views Database» more  SEBD 2007»
13 years 9 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
CAD
2007
Springer
13 years 7 months ago
Boundary of the volume swept by a free-form solid in screw motion
The swept volume of a moving solid is a powerful computational and visualization concept. It provides an excellent aid for path and accessibility planning in robotics and for simu...
Jarek Rossignac, J. J. Kim, S. C. Song, K. C. Suh,...
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 7 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
SIGMOD
2012
ACM
240views Database» more  SIGMOD 2012»
11 years 10 months ago
Finding related tables
We consider the problem of finding related tables in a large corpus of heterogenous tables. Detecting related tables provides users a powerful tool for enhancing their tables wit...
Anish Das Sarma, Lujun Fang, Nitin Gupta 0003, Alo...
APPML
2007
101views more  APPML 2007»
13 years 7 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay