Sciweavers

2272 search results - page 96 / 455
» Capture Complexity by Partition
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
Time-Constrained Photography
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
Samuel W. Hasinoff, Kiriakos N. Kutulakos, Frédo ...
ICIP
2001
IEEE
15 years 11 months ago
Algorithmic modifications to SPIHT
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
Ulug Bayazit, William A. Pearlman
ISCAS
2008
IEEE
106views Hardware» more  ISCAS 2008»
15 years 4 months ago
A quantitative evaluation of C-based synthesis on heterogeneous embedded systems design
C-based design techniques and methodologies have been proposed to tackle the complexity of heterogeneous embedded systems. The heterogeneity comes in the functionalities and the im...
Omar Hammami, Zoukun Wang, Virginie Fresse, Domini...
ISCAS
1999
IEEE
72views Hardware» more  ISCAS 1999»
15 years 2 months ago
Shape-based sequential machine analysis
In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constr...
A. Crews, F. Brewer
PODS
2008
ACM
153views Database» more  PODS 2008»
15 years 10 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar