Sciweavers

99 search results - page 20 / 20
» Extending Classical Theorem Proving for the Semantic Web
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
13 years 4 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
ICFEM
2010
Springer
13 years 3 months ago
A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...
Scott West, Sebastian Nanz, Bertrand Meyer
ICFP
2006
ACM
14 years 4 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
13 years 11 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid