Sciweavers

2314 search results - page 201 / 463
» Minimal Partitions of a Graph
Sort
View
ISVC
2005
Springer
16 years 17 min ago
Image Smoothing and Segmentation by Graph Regularization
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
Sébastien Bougleux, Abderrahim Elmoataz
TIT
2008
224views more  TIT 2008»
15 years 6 months ago
Graph-Based Semi-Supervised Learning and Spectral Kernel Design
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
Rie Johnson, Tong Zhang
CORR
2011
Springer
170views Education» more  CORR 2011»
15 years 1 months ago
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
Marek Chrobak, Lukasz Jez, Jiri Sgall
IEEEHPCS
2010
15 years 4 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
ICCAD
2009
IEEE
151views Hardware» more  ICCAD 2009»
15 years 4 months ago
GREMA: Graph reduction based efficient mask assignment for double patterning technology
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
Yue Xu, Chris Chu