Sciweavers

48 search results - page 2 / 10
» Graph partitioning via adaptive spectral techniques
Sort
View
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
13 years 10 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
MVA
2007
189views Computer Vision» more  MVA 2007»
13 years 6 months ago
Image Segmentation Using Region Merging Combined with a Multi-class Spectral Method
In this paper we propose an image segmentation algorithm that combines region merging with spectral-based techniques. An initial partitioning of the image into primitive regions i...
Fernando C. Monteiro, Aurélio C. Campilho
CVPR
2012
IEEE
11 years 7 months ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
SC
1993
ACM
13 years 9 months ago
Runtime compilation techniques for data partitioning and communication schedule reuse
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...
Ravi Ponnusamy, Joel H. Saltz, Alok N. Choudhary
ICC
2009
IEEE
151views Communications» more  ICC 2009»
14 years 1 days ago
Slow Adaptive OFDMA via Stochastic Programming
—Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OF...
Wei Liang (William) Li, Ying Jun (Angela) Zhang, M...