Sciweavers

1217 search results - page 180 / 244
» On compressing frequent patterns
Sort
View
IAT
2003
IEEE
15 years 9 months ago
A Possible Approach to the Development of Robotic Multi-Agent Systems
The design of a an agent system for robotics is a problem that involves aspects coming from many different disciplines (robotics, artificial intelligence, computer vision, softwa...
Massimo Cossentino, Luca Sabatucci, Antonio Chella
HICSS
2002
IEEE
122views Biometrics» more  HICSS 2002»
15 years 8 months ago
Democratic Participation in the Discursive Management of Usenet
Internet voting, sometimes proposed as a means of enhancing democratic participation, is partly inspired by the democratic process of newsgroup creation on Usenet. To better under...
John C. Paolillo, David Heald
117
Voted
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
15 years 8 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
IWPC
2002
IEEE
15 years 8 months ago
Mining System-User Interaction Traces for Use Case Models
While code understanding is the primary program comprehension activity, it is quite challenging to recognize the application requirements from code, since they have usually been o...
Mohammad El-Ramly, Eleni Stroulia, Paul G. Sorenso...
134
Voted
SIGMETRICS
1998
ACM
110views Hardware» more  SIGMETRICS 1998»
15 years 8 months ago
LoGPC: Modeling Network Contention in Message-Passing Programs
In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message proces...
Csaba Andras Moritz, Matthew Frank