Sciweavers

5030 search results - page 1001 / 1006
» cases 2007
Sort
View
JALC
2007
90views more  JALC 2007»
13 years 10 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
TWC
2008
99views more  TWC 2008»
13 years 10 months ago
Robust transmit processing for frequency-selective fading channels with imperfect channel feedback
Reliable channel state information at the transmitter (CSIT) can improve the throughput of wireless networks significantly. In a realistic scenario, there is a mismatch between th...
Christof Jonietz, Wolfgang H. Gerstacker, Robert S...
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 10 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
BMCBI
2010
80views more  BMCBI 2010»
13 years 10 months ago
Sampling the conformation of protein surface residues for flexible protein docking
Background: The problem of determining the physical conformation of a protein dimer, given the structures of the two interacting proteins in their unbound state, is a difficult on...
Patricia Francis-Lyon, Shengyin Gu, Joel Hass, Nin...
DAM
2007
131views more  DAM 2007»
13 years 10 months ago
Haplotyping with missing data via perfect path phylogenies
Computational methods for inferring haplotype information from genotype data are used in studying the association between genomic variation and medical condition. Recently, Gusfi...
Jens Gramm, Till Nierhoff, Roded Sharan, Till Tant...
« Prev « First page 1001 / 1006 Last » Next »