Sciweavers

986 search results - page 102 / 198
» Efficient Processing of the Cube Operator
Sort
View
CIKM
2006
Springer
15 years 1 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
DEBS
2008
ACM
14 years 12 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
CGF
2010
132views more  CGF 2010»
14 years 10 months ago
Hybrid Booleans
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
Darko Pavic, Marcel Campen, Leif Kobbelt
CORR
2010
Springer
172views Education» more  CORR 2010»
14 years 10 months ago
Alternating-Offer Bargaining Games over the Gaussian Interference Channel
This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through barg...
Xi Liu, Elza Erkip
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
14 years 10 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius