Sciweavers

623 search results - page 47 / 125
» An Empirical Study of Query Specificity
Sort
View
ECSCW
1997
13 years 10 months ago
Doing Software Development: Occasions for Automation and Formalisation
The use of workflow technology has created considerable discussion within the CSCW community. Although the debates have been grounded in theories of work, less has been written abo...
Rebecca E. Grinter
DLOG
2006
13 years 10 months ago
Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually pro...
Vladimir Kolovski, Bijan Parsia, Evren Sirin
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 9 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 9 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 10 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi