Sciweavers

552 search results - page 78 / 111
» On the Complexity of Join Predicates
Sort
View
RULEML
2005
Springer
14 years 1 months ago
Using SWRL and OWL to Capture Domain Knowledge for a Situation Awareness Application Applied to a Supply Logistics Scenario
Abstract. When developing situation awareness applications we begin by constructing an OWL ontology to capture a language of discourse for the domain of interest. Such an ontology,...
Christopher J. Matheus, Kenneth Baclawski, Mieczys...
ESA
2004
Springer
139views Algorithms» more  ESA 2004»
14 years 1 months ago
Comparing Real Algebraic Numbers of Small Degree
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
Ioannis Z. Emiris, Elias P. Tsigaridas
LCPC
2004
Springer
14 years 1 months ago
Branch Strategies to Optimize Decision Trees for Wide-Issue Architectures
Abstract. Branch predictors are associated with critical design issues for nowadays instruction greedy processors. We study two important domains where the optimization of decision...
Patrick Carribault, Christophe Lemuet, Jean-Thomas...
POLICY
2004
Springer
14 years 1 months ago
Cassandra: Distributed Access Control Policies with Tunable Expressiveness
We study the specification of access control policy in large-scale distributed systems. Our work on real-world policies has shown that standard policy idioms such as role hierarc...
Moritz Y. Becker, Peter Sewell
STACS
2010
Springer
14 years 24 days ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov