274 search results - page 31 / 55 » Computational complexity of queries based on itemsets |
88
Voted
BIS
2008
15 years 1 months ago
2008
Abstract. A common task in business process modelling is the verification of process models regarding syntactical and structural errors. While the former might be checked with low ...
113
Voted
ICCSA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
162
click to vote
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we propose a novel architecture, CARD, for resource discovery in large scale MANets that may scale up to thousands of nodes. Our mechanism is suitable for resource d...
164
click to vote
AMR
2008
Springer
15 years 2 months ago
2008
Springer
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...