Sciweavers

1522 search results - page 47 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
FOCS
2003
IEEE
14 years 1 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 28 days ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 9 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
EOR
2002
74views more  EOR 2002»
13 years 7 months ago
Modeling multistage cutting stock problems
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
Eugene J. Zak
ICSE
2009
IEEE-ACM
14 years 8 months ago
In-field healing of integration problems with COTS components
Developers frequently integrate complex COTS frameworks and components in software applications. COTS products are often only partially documented, and developers may misuse techn...
Hervé Chang, Leonardo Mariani, Mauro Pezz&e...