Sciweavers

1898 search results - page 293 / 380
» Weak Keys for IDEA
Sort
View
INFORMATICALT
2007
164views more  INFORMATICALT 2007»
13 years 10 months ago
Extracting Personalised Ontology from Data-Intensive Web Application: an HTML Forms-Based Reverse Engineering Approach
The advance of the Web has significantly and rapidly changed the way of information organization, sharing and distribution. The next generation of the web, the semantic web, seeks...
Sidi Mohamed Benslimane, Mimoun Malki, Mustapha Ka...
ISCI
2007
170views more  ISCI 2007»
13 years 10 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
JCB
2007
108views more  JCB 2007»
13 years 10 months ago
A Dynamic Programming Approach for Finding Common Patterns in RNAs
We developed a dynamic programming approach of computing common sequence structure patterns among two RNAs given their primary sequences and their secondary structures. Common pat...
Sven Siebert, Rolf Backofen
JCP
2007
148views more  JCP 2007»
13 years 9 months ago
P3ARM-t: Privacy-Preserving Protocol for Association Rule Mining with t Collusion Resistance
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
Iman Saleh, Mohamed Eltoweissy
CANDC
2005
ACM
13 years 9 months ago
Integer linear programming as a tool for constructing trees from quartet data
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...