Sciweavers

148 search results - page 23 / 30
» Query Evaluation via Tree-Decompositions
Sort
View
129
Voted
ICML
2010
IEEE
15 years 4 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
118
Voted
SEMWEB
2009
Springer
15 years 10 months ago
Functions over RDF Language Elements
Spreadsheet tools are often used in business and private scenarios in order to collect and store data, and to explore and analyze these data by executing functions and aggregation...
Bernhard Schandl
142
Voted
VLDB
2002
ACM
91views Database» more  VLDB 2002»
15 years 3 months ago
DTD-Directed Publishing with Attribute Translation Grammars
We present a framework for publishing relational data in XML with respect to a fixed DTD. In data exchange on the Web, XML views of relational data are typically required to confo...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Raje...
128
Voted
JELIA
2010
Springer
15 years 2 months ago
Decomposition of Distributed Nonmonotonic Multi-Context Systems
Multi-Context Systems (MCS) are formalisms that enable the interlinkage of single knowledge bases, called contexts, via bridge rules. Recently, the evaluation of heterogeneous, no...
Seif El-Din Bairakdar, Minh Dao-Tran, Thomas Eiter...
131
Voted
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
16 years 3 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano