Sciweavers

1629 search results - page 136 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
DAGM
2009
Springer
14 years 11 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
ASPDAC
1998
ACM
72views Hardware» more  ASPDAC 1998»
15 years 2 months ago
Space- and Time-Efficient BDD Construction via Working Set Control
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...
Bwolen Yang, Yirng-An Chen, Randal E. Bryant, Davi...
TCAD
2008
215views more  TCAD 2008»
14 years 10 months ago
Total Energy Minimization of Real-Time Tasks in an On-Chip Multiprocessor Using Dynamic Voltage Scaling Efficiency Metric
Abstract--This paper proposes an algorithm that provides both dynamic voltage scaling and power shutdown to minimize the total energy consumption of an application executed on an o...
Hyunjin Kim, Hyejeong Hong, Hong-Sik Kim, Jin-Ho A...
ICFP
2008
ACM
15 years 10 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ICMCS
2005
IEEE
130views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Efficient Segment-Based Video Transcoding Proxy for Mobile Multimedia Services
To support various bandwidth requirements for mobile multimedia services for future heterogeneous mobile environments, a transcoding video proxy is usually necessary to provide ad...
Kuei-Chung Chang, Ren-Yo Wu, Tien-Fu Chen