6568 search results - page 1009 / 1314 » Reducing the Complexity of Reductions |
185
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
169
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
173
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
271
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
240
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
The work performed by a publish/subscribe system can conceptually be divided into subscription processing and notification dissemination. Traditionally, research in the database a...