Sciweavers

327 search results - page 17 / 66
» Some Elimination Problems for Matrices
Sort
View
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
14 years 1 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert
ICML
2005
IEEE
14 years 10 months ago
Fast inference and learning in large-state-space HMMs
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
Sajid M. Siddiqi, Andrew W. Moore
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 3 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
CVPR
2004
IEEE
14 years 12 months ago
Linear Projection Methods in Face Recognition under Unconstrained Illuminations: A Comparative Study
Face recognition under unconstrained illuminations (FR/I) received extensive study because of the existence of illumination subspace. [2] presented a study on the comparison betwe...
Qi Li, Jieping Ye, Chandra Kambhamettu