Sciweavers

2899 search results - page 562 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 1 months ago
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
Bart De Moor, Frizo A. L. Janssens, Wolfgang Gl&au...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 1 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 1 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
SAC
2010
ACM
15 years 8 months ago
Adaptive internet services through performance and availability control
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
Jean Arnaud, Sara Bouchenak
SC
2009
ACM
15 years 8 months ago
Enabling high-fidelity neutron transport simulations on petascale architectures
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...
Dinesh K. Kaushik, Micheal Smith, Allan Wollaber, ...