Sciweavers

528 search results - page 15 / 106
» Degrees of categoricity of computable structures
Sort
View
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
14 years 9 months ago
Entity categorization over large document collections
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
Arnd Christian König, Rares Vernica, Venkates...
ERCIMDL
2007
Springer
115views Education» more  ERCIMDL 2007»
14 years 2 months ago
The Semantic GrowBag Algorithm: Automatically Deriving Categorization Systems
Using keyword search to find relevant objects in digital libraries often results in way too large result sets. Based on the metadata associated with such objects, the faceted sear...
Jörg Diederich, Wolf-Tilo Balke
ICCV
1999
IEEE
14 years 10 months ago
Semantic Organization of Scenes using Discriminant Structural Templates
In this paper, we present a procedure for organizing real world scenes along semantic axes. The approach is based on the output energies of linear discriminant filters that take i...
Antonio B. Torralba, Aude Oliva
AML
2008
72views more  AML 2008»
13 years 8 months ago
On Lachlan's major sub-degree problem
The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees. ...
S. Barry Cooper, Angsheng Li
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 8 months ago
Table manipulation in simplicial databases
In [Spi], we developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, our...
David I. Spivak