Sciweavers

662 search results - page 23 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
AIMSA
2010
Springer
13 years 9 months ago
Expressive Approximations in DL-Lite Ontologies
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 8 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
EDBT
2006
ACM
136views Database» more  EDBT 2006»
14 years 8 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
WWW
2010
ACM
14 years 1 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...