Sciweavers

14161 search results - page 403 / 2833
» On generalized middle-level problem
Sort
View
DLOG
1996
15 years 8 months ago
An HTML Interface for Classic
Several significant problems exist whenapplying knowledge representation systems to real problems. In particular, the obscurity of LISP, the resource consumption, garbage collecti...
Christopher A. Welty
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Hitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra...
DM
2008
88views more  DM 2008»
15 years 6 months ago
Packing triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
Gordana Manic, Yoshiko Wakabayashi
NPL
2008
68views more  NPL 2008»
15 years 6 months ago
On Nonparametric Residual Variance Estimation
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
Elia Liitiäinen, Francesco Corona, Amaury Len...
JACM
2002
94views more  JACM 2002»
15 years 6 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers