Sciweavers

26 search results - page 4 / 6
» Exactly Learning Automata with Small Cover Time
Sort
View
WG
2004
Springer
13 years 10 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
12 years 8 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
BMCBI
2006
239views more  BMCBI 2006»
13 years 5 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...
JCC
2011
87views more  JCC 2011»
13 years 9 days ago
Determining equilibrium constants for dimerization reactions from molecular dynamics simulations
Abstract: With today’s available computer power, free energy calculations from equilibrium molecular dynamics simulations “via counting” become feasible for an increasing num...
Djurre H. De Jong, Lars V. Schäfer, Alex H. D...
ICDM
2007
IEEE
96views Data Mining» more  ICDM 2007»
13 years 11 months ago
The Chosen Few: On Identifying Valuable Patterns
Constrained pattern mining extracts patterns based on their individual merit. Usually this results in far more patterns than a human expert or a machine learning technique could m...
Björn Bringmann, Albrecht Zimmermann