6740 search results - page 209 / 1348 » An s -Hamiltonian Line Graph Problem |
BIOINFORMATICS
2010
13 years 9 months ago
2010
Motivation: Peaks are the key information in Mass Spectrometry (MS) which has been increasingly used to discover diseases related proteomic patterns. Peak detection is an essentia...
KDD
2001
ACM
14 years 11 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
SIAMJO
2008
13 years 10 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
PVLDB
2010
13 years 9 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
AUTOMATICA
2010
13 years 11 months ago
2010
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...