Sciweavers

2254 search results - page 414 / 451
» Computing the minimal covering set
Sort
View
JSC
2006
52views more  JSC 2006»
13 years 10 months ago
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonn...
Jesús A. De Loera, Shmuel Onn
BMCBI
2005
116views more  BMCBI 2005»
13 years 9 months ago
Can Zipf's law be adapted to normalize microarrays?
Background: Normalization is the process of removing non-biological sources of variation between array experiments. Recent investigations of data in gene expression databases for ...
Timothy Lu, Christine M. Costello, Peter J. P. Cro...
KER
2007
90views more  KER 2007»
13 years 9 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
IDA
2002
Springer
13 years 9 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
COR
2007
106views more  COR 2007»
13 years 9 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...