Sciweavers

276 search results - page 51 / 56
» The Complexity of Computing Maximal Word Functions
Sort
View
KSEM
2009
Springer
14 years 2 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
PDC
2004
ACM
14 years 27 days ago
From small scale to large scale user participation: a case study of participatory design in e-government systems
Most experiments with participative design are with small scale, stand alone and not very strategic applications of ICT in organizations. However, modern ICT applications are incr...
Anne-Marie Oostveen, Peter Van den Besselaar
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
JCC
2011
154views more  JCC 2011»
12 years 10 months ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
JCC
2007
79views more  JCC 2007»
13 years 7 months ago
Interfacing Q-Chem and CHARMM to perform QM/MM reaction path calculations
Abstract: A hybrid quantum mechanical/molecular mechanical (QM/MM) potential energy function with HartreeFock, density functional theory (DFT), and post-HF (RIMP2, MP2, CCSD) capab...
H. Lee Woodcock III, Milan Hodoscek, Andrew T. B. ...