Sciweavers

182 search results - page 22 / 37
» Versions of Simple and Composite Objects
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 22 days ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
EJC
2003
15 years 5 months ago
An Algebraic Approach for Specifying Compound Terms in Faceted Taxonomies
Abstract. A faceted taxonomy is a set of taxonomies, each describing a given domain from a different aspect, or facet. The indexing of domain objects is done through conjunctive c...
Yannis Tzitzikas, Anastasia Analyti, Nicolas Spyra...
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 4 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
MFCS
2005
Springer
15 years 9 months ago
Online and Dynamic Recognition of Squarefree Strings
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
Jesper Jansson, Zeshan Peng
ECAI
1990
Springer
15 years 8 months ago
Representing Continuous Change in the Event Calculus
The Event Calculus of Kowalski and Sergot only deals with discrete change. This paper introduces a simplified version of the Event Calculus and extends it to deal with continuous ...
Murray Shanahan