Sciweavers

12783 search results - page 282 / 2557
» Experimenting with computing
Sort
View
AUSAI
2003
Springer
15 years 11 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
HICSS
2002
IEEE
118views Biometrics» more  HICSS 2002»
15 years 11 months ago
Computer-Mediated and Face-to-Face Groups: Who Makes Riskier Decisions?
Although a significant body of research has focused on understanding the effect of media differences on group behaviors and processes, little is known about how media differences ...
Joseph S. Valacich, Saonee Sarker, Jamie Pratt, Mi...
EUROCAST
2001
Springer
106views Hardware» more  EUROCAST 2001»
15 years 11 months ago
On CAST.FSM Computation of Hierarchical Multi-layer Networks of Automata
CAST.FSM denotes a CAST tool which has been developed at the Institute of Systems Science at the University of Linz during the years 1986-1993. The first version of CAST.FSM was i...
Michael Affenzeller, Franz Pichler, Rudolf Mittelm...
ICDAR
2007
IEEE
15 years 10 months ago
On Computing Strength of Evidence for Writer Verification
The problem of Writer Verification is to make a decision of whether or not two handwritten documents are written by the same person. Providing a strength of evidence for any such ...
Harish Srinivasan, S. Kabra, Chen Huang, Sargur N....
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 10 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...