1452 search results - page 188 / 291 » Algorithmic Analysis of Array-Accessing Programs |
111
click to vote
TSP
2010
14 years 7 months ago
2010
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
120
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
101
click to vote
NIPS
2008
15 years 2 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
118
click to vote
BMCBI
2008
15 years 25 days ago
2008
Background: A typical step in the analysis of gene expression data is the determination of clusters of genes that exhibit similar expression patterns. Researchers are confronted w...
IWMM
2000
Springer
15 years 4 months ago
2000
Springer
We study the effectiveness of garbage collection (GC) algorithms by measuring the time difference between the actual collection time of an object and the potential earliest collec...