Sciweavers

2503 search results - page 421 / 501
» A study of 3-arc graphs
Sort
View
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 4 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
14 years 4 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
GEOS
2007
Springer
14 years 4 months ago
Modeling Spatio-temporal Network Computations: A Summary of Results
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of...
Betsy George, Shashi Shekhar
ICCS
2007
Springer
14 years 4 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
LADC
2007
Springer
14 years 4 months ago
Connectivity in Eventually Quiescent Dynamic Distributed Systems
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
Sara Tucci Piergiovanni, Roberto Baldoni