681 search results - page 78 / 137 » General Polynomial Time Decomposition Algorithms |
121
Voted
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
154
Voted
ALGOSENSORS
2009
Springer
15 years 9 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
132
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
127
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
162
Voted
RECOMB
2004
Springer
16 years 2 months ago
2004
Springer
In situ staining of a target mRNA at several time points during the development of a D. melanogaster embryo gives one a detailed spatio-temporal view of the expression pattern of ...