Sciweavers

256 search results - page 15 / 52
» Uncertainty Reasoning for Linked Data
Sort
View
POPL
2006
ACM
14 years 8 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
14 years 2 months ago
Granularity Conscious Modeling for Probabilistic Databases
The convergence of embedded sensor systems and stream query processing suggests an important role for database techniques, in managing data that only partially – and often inacc...
Eirinaios Michelakis, Daisy Zhe Wang, Minos N. Gar...
SEMWEB
2005
Springer
14 years 1 months ago
PR-OWL: A Bayesian Ontology Language for the Semantic Web
This paper addresses a major weakness of current technologies for the Semantic Web, namely the lack of a principled means to represent and reason about uncertainty. This not only h...
Paulo Cesar G. da Costa, Kathryn B. Laskey, Kennet...
UIST
2010
ACM
13 years 5 months ago
Mixture model based label association techniques for web accessibility
An important aspect of making the Web accessible to blind users is ensuring that all important web page elements such as links, clickable buttons, and form fields have explicitly ...
Muhammad Asiful Islam, Yevgen Borodin, I. V. Ramak...
TIME
2007
IEEE
14 years 2 months ago
On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
David Toman