Sciweavers

2584 search results - page 440 / 517
» On the Forward Checking Algorithm
Sort
View
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 2 months ago
Association Analysis with One Scan of Databases
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
Hao Huang, Xindong Wu, Richard Relue
PLDI
2009
ACM
14 years 1 months ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 1 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
ICSE
2001
IEEE-ACM
14 years 1 months ago
Fast Formal Analysis of Requirements via "Topoi Diagrams"
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
Tim Menzies, John D. Powell, Michael E. Houle
ASAP
2000
IEEE
90views Hardware» more  ASAP 2000»
14 years 1 months ago
Subword Permutation Instructions for Two-Dimensional Multimedia Processing in MicroSIMD Architectures
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
Ruby B. Lee