Sciweavers

1648 search results - page 183 / 330
» On the generation of bicliques of a graph
Sort
View
CODES
2010
IEEE
13 years 7 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
TMM
2010
249views Management» more  TMM 2010»
13 years 3 months ago
Bridging the Semantic Gap Between Image Contents and Tags
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
Hao Ma, Jianke Zhu, Michael R. Lyu, Irwin King
MOBIHOC
2001
ACM
14 years 8 months ago
Comparison between graph-based and interference-based STDMA scheduling
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
Anders Hansson, Jimmi Grönkvist
FPGA
2010
ACM
243views FPGA» more  FPGA 2010»
14 years 6 months ago
Bit-level optimization for high-level synthesis and FPGA-based acceleration
d hardware design from behavior-level abstraction has drawn wide interest in FPGA-based acceleration and configurable computing research field. However, for many high-level progra...
Jiyu Zhang, Zhiru Zhang, Sheng Zhou, Mingxing Tan,...
ATAL
2007
Springer
14 years 3 months ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima