Sciweavers

1187 search results - page 182 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
JVCIR
2010
177views more  JVCIR 2010»
14 years 8 months ago
Ripplet: A new transform for image processing
Efficient representation of images usually leads to improvements in storage efficiency, computational complexity and performance of image processing algorithms. Efficient represe...
Jun Xu, Lei Yang, Dapeng Wu
MA
2010
Springer
150views Communications» more  MA 2010»
14 years 4 months ago
Cokriging for spatial functional data
This work proposes to generalize the method of cokriging when data are spatially sampled curves. A spatial functional linear model is constructed including spatial dependencies be...
David Nerini, Pascal Monestiez, Claude Manté...
BMCBI
2006
113views more  BMCBI 2006»
14 years 9 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
DAC
2007
ACM
15 years 10 months ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
ICALP
2010
Springer
15 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket