4843 search results - page 478 / 969 » The Shortcut Problem - Complexity and Approximation |
246
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
236
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
142
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
184
click to vote
IPPS
2009
IEEE
16 years 27 days ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
174
click to vote
AINA
2007
IEEE
16 years 18 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...