Sciweavers

7519 search results - page 263 / 1504
» Optimizing Generic Functions
Sort
View
ICDM
2009
IEEE
147views Data Mining» more  ICDM 2009»
15 years 4 months ago
Greedy Optimization for Contiguity-Constrained Hierarchical Clustering
The discovery and construction of inherent regions in large spatial datasets is an important task for many research domains such as climate zoning, eco-region analysis, public heal...
Diansheng Guo
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman
ICIP
2005
IEEE
16 years 8 months ago
Greedy non-linear approximation of the plenoptic function for interactive transmission of 3D scenes
We consider an interactive browsing environment, with greedy optimization of a current view, conditioned on the availability of previously transmitted information for other (possi...
Pietro Zanuttigh, Nicola Brusco, David Taubman, Gu...
ICIP
2004
IEEE
16 years 8 months ago
Distributed compression of the plenoptic function
In this paper, we consider the problem of distributed compression in camera sensor networks. Due to the spatial proximity of the different cameras, acquired images can be highly d...
Nicolas Gehrig, Pier Luigi Dragotti
DAC
2004
ACM
16 years 7 months ago
A method for correcting the functionality of a wire-pipelined circuit
As across-chip interconnect delays can exceed a clock cycle, wire pipelining becomes essential in high performance designs. Although it allows higher clock frequencies, it may cha...
Vidyasagar Nookala, Sachin S. Sapatnekar