Sciweavers

82 search results - page 15 / 17
» Efficient algorithms for finding critical subgraphs
Sort
View
AAAI
2004
13 years 8 months ago
Hiding Satisfying Assignments: Two Are Better than One
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
Dimitris Achlioptas, Haixia Jia, Cristopher Moore
JMLR
2006
80views more  JMLR 2006»
13 years 7 months ago
Using Machine Learning to Guide Architecture Simulation
An essential step in designing a new computer architecture is the careful examination of different design options. It is critical that computer architects have efficient means by ...
Greg Hamerly, Erez Perelman, Jeremy Lau, Brad Cald...
VIS
2007
IEEE
169views Visualization» more  VIS 2007»
14 years 8 months ago
Visual Verification and Analysis of Cluster Detection for Molecular Dynamics
A current research topic in molecular thermodynamics is the condensation of vapor to liquid and the investigation of this process at the molecular level. Condensation is found in m...
Sebastian Grottel, Guido Reina, Jadran Vrabec, ...
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
14 years 7 months ago
DiMaC: a disguised missing data cleaning tool
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
14 years 7 months ago
DiMaC: a system for cleaning disguised missing data
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei