Sciweavers

1864 search results - page 96 / 373
» Formal topology and domains
Sort
View
CORR
2002
Springer
81views Education» more  CORR 2002»
15 years 6 months ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint
ICIP
2005
IEEE
16 years 8 months ago
A genetic algorithm-based approach to knowledge-assisted video analysis
Efficient video content management and exploitation requires extraction of the underlying semantics, a non-trivial task associating low-level features of the image domain and high...
Frédéric Precioso, Ioannis Kompatsia...
EON
2007
15 years 7 months ago
Benchmarking Reasoners for Multi-Ontology Applications
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
Ameet Chitnis, Abir Qasem, Jeff Heflin
DASFAA
2011
IEEE
231views Database» more  DASFAA 2011»
14 years 10 months ago
Querying Moving Objects with Uncertainty in Spatio-Temporal Databases
Spatio-temporal uncertainty is a special feature of moving objects due to the inability of precisely capturing or predicting their continuously changing locations. Indeterminate lo...
Hechen Liu, Markus Schneider
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 10 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara