Sciweavers

4526 search results - page 150 / 906
» Algorithmic problems related to the Internet
Sort
View
SEMWEB
2009
Springer
15 years 11 months ago
CompositeMatch: Detecting N-ary Matches in Ontology Alignment
Abstract. The field of ontology alignment still contains numerous unresolved problems, one of which is the accurate identification of composite matches. In this work, we present ...
Kelly Moran, Kajal T. Claypool, Benjamin J. Hescot...
ASIAN
2004
Springer
117views Algorithms» more  ASIAN 2004»
15 years 9 months ago
The Feature Selection and Intrusion Detection Problems
Cyber security is a serious global concern. The potential of cyber terrorism has posed a threat to national security; meanwhile the increasing prevalence of malware and incidents o...
Andrew H. Sung, Srinivas Mukkamala
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
15 years 4 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang
INFORMATICALT
2002
82views more  INFORMATICALT 2002»
15 years 4 months ago
Data Aggregation Sets in Adaptive Data Model
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
Petras Gailutis Adomenas, Algirdas Ciucelis
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 4 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky