Sciweavers

3204 search results - page 598 / 641
» The b-chromatic Number of a Graph
Sort
View
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 1 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
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
14 years 1 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...
RECOMB
2007
Springer
14 years 1 months ago
Network Legos: Building Blocks of Cellular Wiring Diagrams
Publicly-available data sets provide detailed and large-scale information on multiple types of molecular interaction networks in a number of model organisms. These multi-modal univ...
T. M. Murali, Corban G. Rivera
SEMWEB
2007
Springer
14 years 1 months ago
Using the AgreementMaker to Align Ontologies for the OAEI Campaign 2007
In this paper, we present the AgreementMaker, an ontology alignment tool that incorporates the Descendants Similarity Inheritance (DSI) method. This method uses the structure of th...
William Sunna, Isabel F. Cruz