Sciweavers

3250 search results - page 361 / 650
» Parameterized Learning Complexity
Sort
View
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
15 years 11 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
GLOBECOM
2008
IEEE
15 years 11 months ago
MIMO UWB Systems Based on Linear Precoded OFDM for Home Gigabit Applications
Abstract— In this paper, we investigate the use of multipleinput multiple-output (MIMO) techniques with linear precoded orthogonal frequency division multiplexing (LP-OFDM) wavef...
Antoine Stephan, Jean-François Hélar...
173
Voted
ANSS
2007
IEEE
15 years 11 months ago
JANE - The Java Ad Hoc Network Development Environment
This work describes a Java based development platform which is intended to support ad hoc network researchers in application and protocol design. Software development within this ...
Daniel Görgen, Hannes Frey, Christian Hiedels
LPNMR
2007
Springer
15 years 11 months ago
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
Stefan Woltran
FOCS
2006
IEEE
15 years 10 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor