791 search results - page 83 / 159 » Approximating the Maximum Sharing Problem |
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
We provide approximate expressions for the covariance matrix of kinetic parameter estimators based on time activity curve (TAC) reconstructions when TACs are modeled as a linear c...
IPL
2006
13 years 7 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
TCOM
2010
13 years 2 months ago
2010
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
TSP
2008
13 years 7 months ago
2008
Abstract--We consider the adaptive detection of a signal of interest embedded in colored noise, when the environment is nonhomogeneous, i.e., when the training samples used for ada...