4469 search results - page 645 / 894 » Dynamic Program Slicing |
105
click to vote
ICASSP
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...
102
click to vote
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
We consider Internet broadband access as an elastic service whose value varies across segments of the user population. We show that introducing multiple tiers of service can be an ...
150
Voted
ASAP
2004
IEEE
15 years 6 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
118
click to vote
CODES
2004
IEEE
15 years 6 months ago
2004
IEEE
In this paper, we present an approach for automatic synthesis of System on Chip (SoC) multiprocessor architectures for applications expressed as process networks. Our approach is ...
115
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...