Sciweavers

15 search results - page 3 / 3
» The complexity of non-hierarchical clustering with instance ...
Sort
View
AROBOTS
2011
13 years 15 days ago
Time-extended multi-robot coordination for domains with intra-path constraints
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
Edward Gil Jones, M. Bernardine Dias, Anthony Sten...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 5 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
BMCBI
2006
203views more  BMCBI 2006»
13 years 5 months ago
Independent component analysis reveals new and biologically significant structures in micro array data
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
Attila Frigyesi, Srinivas Veerla, David Lindgren, ...
JCC
2007
79views more  JCC 2007»
13 years 5 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. ...
MKM
2009
Springer
14 years 13 hour ago
OpenMath in SCIEnce: SCSCP and POPCORN
In this short communication we want to give an overview of how OpenMath is used in the European project “SCIEnce” [12]. The main aim of this project is to allow unified commun...
Peter Horn, Dan Roozemond