Sciweavers

1629 search results - page 96 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Associative hierarchical CRFs for object class image segmentation
Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space - pixels, segments or group of segments. It...
Lubor Ladicky, Christopher Russell, Pushmeet Kohli...
CCGRID
2009
IEEE
15 years 1 months ago
Energy-Efficient Cluster Computing via Accurate Workload Characterization
This paper presents an eco-friendly daemon that reduces power and energy consumption while better maintaining high performance via an accurate workload characterization that infer...
S. Huang, W. Feng
WABI
2009
Springer
162views Bioinformatics» more  WABI 2009»
15 years 4 months ago
Aligning Biomolecular Networks Using Modular Graph Kernels
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
Fadi Towfic, M. Heather West Greenlee, Vasant Hona...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
14 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
DAC
2006
ACM
15 years 11 months ago
Timing driven power gating
Power Gating is effective for reducing leakage power. Previously, a Distributed Sleep Transistor Network (DSTN) was proposed to reduce the sleep transistor area by connecting all ...
De-Shiuan Chiou, Shih-Hsin Chen, Shih-Chieh Chang,...