Sciweavers

1938 search results - page 247 / 388
» Extending Conceptual Models for Web Based Applications
Sort
View
AAAI
1997
13 years 9 months ago
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
Rahul Roy-Chowdhury, Mukesh Dalal
ICDCS
1996
IEEE
14 years 5 days ago
Hidden Software Capabilities
: Software capabilities are a very convenient means to protect co-operating applications. They allow access rights to be dynamically exchanged between mutually suspicious interacti...
Daniel Hagimont, Jacques Mossière, Xavier R...
TASE
2007
IEEE
14 years 2 months ago
Constraint-Based Policy Negotiation and Enforcement for Telco Services
Telco services are evolving under several aspects: for instance, services may combine different telecommunication features (messaging, multi-media, etc.) and may be activated and...
Maria Grazia Buscemi, Laura Ferrari, Corrado Moiso...
WWW
2005
ACM
14 years 8 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
TREC
2003
13 years 9 months ago
Fondazione Ugo Bordoni at TREC 2003: Robust and Web Track
Our participation in TREC 2003 aims to adapt the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) to the robust track and the topic distillation task o...
Giambattista Amati, Claudio Carpineto, Giovanni Ro...