Sciweavers

165 search results - page 30 / 33
» A New Algorithm for On-line Coloring Bipartite Graphs
Sort
View
MM
2006
ACM
103views Multimedia» more  MM 2006»
14 years 1 months ago
Progressive cut
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhong...
VLSISP
2002
112views more  VLSISP 2002»
13 years 7 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
AAAI
1998
13 years 9 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
BIRTHDAY
2010
Springer
13 years 8 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
DAC
2006
ACM
14 years 8 months ago
Novel full-chip gridless routing considering double-via insertion
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures. To improve via yield and reliability, redundant-via insertion is a highl...
Huang-Yu Chen, Mei-Fang Chiang, Yao-Wen Chang, Lum...