Sciweavers

2490 search results - page 253 / 498
» Complexity of Contextual Reasoning
Sort
View
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 6 months ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans
GIS
2008
ACM
15 years 6 months ago
Geographical analysis of hierarchical business structures by interactive drill down
This paper deals with the geographical analysis and visualization of network marketing. The aim of the study was to develop interactive visual methods, which help to answer questi...
Klaus Böhm, Eva Daub
GIS
2006
ACM
15 years 6 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
JMLR
2006
103views more  JMLR 2006»
15 years 6 months ago
MinReg: A Scalable Algorithm for Learning Parsimonious Regulatory Networks in Yeast and Mammals
In recent years, there has been a growing interest in applying Bayesian networks and their extensions to reconstruct regulatory networks from gene expression data. Since the gene ...
Dana Pe'er, Amos Tanay, Aviv Regev
ENTCS
2007
129views more  ENTCS 2007»
15 years 6 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...