Sciweavers

6650 search results - page 1297 / 1330
» Mutating database queries
Sort
View
CSL
2009
Springer
14 years 1 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
SIGIR
2010
ACM
14 years 1 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
ECAI
1998
Springer
14 years 1 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
EDBT
2009
ACM
126views Database» more  EDBT 2009»
14 years 1 months ago
A tool for mapping discovery over revealing schemas
In a world of wide-scale information sharing, the decentralized coordination has to consolidate a variety of heterogeneity. Shared data are described in different formats, i.e. da...
Verena Kantere, Dimos Bousounis, Timos K. Sellis
CIKM
2008
Springer
13 years 12 months ago
Identifying table boundaries in digital documents via sparse line detection
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
Ying Liu, Prasenjit Mitra, C. Lee Giles
« Prev « First page 1297 / 1330 Last » Next »