1486 search results - page 213 / 298 » Algorithms for two-box covering |
125
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We study the problem of determining, given a run of a concurrent program, whether there is any alternate execution of it that violates atomicity, where atomicity is defin...
175
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
123
click to vote
CHI
2002
ACM
16 years 5 months ago
2002
ACM
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
230
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
221
click to vote
VLDB
2001
ACM
16 years 5 months ago
2001
ACM
In this paper, we present an approach to global transactionmanagementinworkflowenvironments.Thetransaction mechanism is based on the well-known notion of compensation, but extended...