Sciweavers

2089 search results - page 102 / 418
» A New Problem in String Searching
Sort
View
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 1 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 10 months ago
A New Email Retrieval Ranking Approach
Email Retrieval task has recently taken much attention to help the user retrieve the email(s) related to the submitted query. Up to our knowledge, existing email retrieval ranking...
Samir AbdelRahman, Basma Hassan, Reem Bahgat
AAAI
2008
15 years 6 days ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
IEEECIT
2009
IEEE
15 years 4 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
AIPS
2000
14 years 11 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...