Sciweavers

693 search results - page 50 / 139
» Minimization and Partitioning Method Reducing Input Sets
Sort
View
TIT
2008
86views more  TIT 2008»
15 years 1 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
KES
2006
Springer
15 years 1 months ago
Genetic-Fuzzy Modeling on High Dimensional Spaces
In this paper, in order to reduce the explosive increase of the search space as the input dimension grows, we present a new representation method for the structure of fuzzy rules, ...
Joon-Min Gil, SeongHoon Lee
ICTAI
2005
IEEE
15 years 7 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
ECCV
2010
Springer
14 years 11 months ago
Supervised Label Transfer for Semantic Segmentation of Street Scenes
In this paper, we propose a robust supervised label transfer method for the semantic segmentation of street scenes. Given an input image of street scene, we first find multiple ima...
Honghui Zhang, Jianxiong Xiao, Long Quan
125
Voted
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
15 years 5 months ago
Transistor reordering rules for power reduction in CMOS gates
— The goal of transistor reordering for a logic gate is to reduce the propagation delay as well as the charging and discharging of internal capacitances to achieve low power cons...
Wen-Zen Shen, Jiing-Yuan Lin, Fong-Wen Wang