Sciweavers

335 search results - page 15 / 67
» High quality graph partitioning
Sort
View
WWW
2008
ACM
14 years 11 months ago
Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
Manjeet Rege, Ming Dong, Jing Hua
DAC
1989
ACM
14 years 3 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
ISCAS
2002
IEEE
124views Hardware» more  ISCAS 2002»
14 years 3 months ago
Performance optimization of multiple memory architectures for DSP
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
Qingfeng Zhuge, Bin Xiao, Edwin Hsing-Mean Sha
TMC
2011
182views more  TMC 2011»
13 years 5 months ago
Dynamic Time Slot Partitioning for Multimedia Transmission in Two-Hop Cellular Networks
—In recent years, there has been an exponential increase in the number of mobile phone users. In addition, a significant growth in the demand for high-rate multimedia services o...
Hrishikesh Venkataraman, Gabriel-Miro Muntean
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
14 years 5 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu