Sciweavers

282 search results - page 45 / 57
» Generating non-redundant association rules
Sort
View
ICDE
2008
IEEE
125views Database» more  ICDE 2008»
15 years 11 months ago
RAD: A Scalable Framework for Annotator Development
Developments in semantic search technology have motivated the need for efficient and scalable entity annotation techniques. We demonstrate RAD: a tool for Rapid Annotator Developme...
Sanjeet Khaitan, Ganesh Ramakrishnan, Sachindra Jo...
SIGSOFT
2007
ACM
15 years 10 months ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
KDD
2007
ACM
566views Data Mining» more  KDD 2007»
15 years 10 months ago
IMDS: intelligent malware detection system
The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based antivirus systems fail to detect polymorphic and new, ...
Yanfang Ye, Dingding Wang, Tao Li, Dongyi Ye
FUIN
2007
108views more  FUIN 2007»
14 years 9 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
CPP
2011
107views more  CPP 2011»
13 years 9 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge