962 search results - page 31 / 193 » Efficient Algorithms for Eulerian Extension |
121
click to vote
DEBS
2008
ACM
14 years 11 months ago
2008
ACM
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...
185
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
169
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
85
Voted
KDD
2004
ACM
15 years 10 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
108
click to vote
BMCBI
2002
14 years 9 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...