5962 search results - page 344 / 1193 » Efficient Clustering for Orders |
187
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
182
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
188
click to vote
EDBTW
2006
Springer
15 years 8 months ago
2006
Springer
The need for incremental constraint maintenance within collections of semi-structured documents has been ever increasing in the last years due to the widespread diffusion of XML. T...
238
Voted
SEBD
2008
15 years 8 months ago
2008
Abstract. Peer Data Management Systems (PDMSs) have been recently proposed as an evolution of Peer-To-Peer (P2P) systems toward a more semantics-based description of peers' co...
169
click to vote
IJCAI
2003
15 years 8 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...