Sciweavers

234 search results - page 1 / 47
» Algorithmic Power from Declarative Use of Redundant Constrai...
Sort
View
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
13 years 4 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
DEBS
2011
ACM
12 years 8 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke
ECAI
2000
Springer
13 years 9 months ago
Activity Recognition from Video Sequences using Declarative Models
Abstract. We propose here a new approach for video sequence interpretation based on declarative models of activities. The aim of the video sequence interpretation is to recognize i...
Nathanaël Rota, Monique Thonnat
ICDE
2005
IEEE
124views Database» more  ICDE 2005»
14 years 6 months ago
XML Views as Integrity Constraints and their Use in Query Translation
The SQL queries produced in XML-to-SQL query translation are often unnecessarily complex, even for simple input XML queries. In this paper we argue that relational systems can do ...
Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F...
ICTAI
2003
IEEE
13 years 10 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...