Sciweavers

8728 search results - page 231 / 1746
» On Reduct Construction Algorithms
Sort
View
DAC
2003
ACM
15 years 12 months ago
Realizable RLCK circuit crunching
Reduction of an extracted netlist is an important pre-processing step for techniques such as model order reduction in the design and analysis of VLSI circuits. This paper describe...
Chirayu S. Amin, Masud H. Chowdhury, Yehea I. Isma...
ISBI
2006
IEEE
16 years 7 months ago
Registration of brain images with tumors: towards the construction of statistical atlases for therapy planning
A deformable registration method is proposed to register a brain atlas with tumor-bearing brain scans. The tumor mass effect is first simulated in the (normal) atlas, using a biom...
Evangelia I. Zacharaki, Dinggang Shen, Ashraf Moha...
SEMWEB
2009
Springer
16 years 1 months ago
Exploiting Partial Information in Taxonomy Construction
One of the core services provided by OWL reasoners is classification: the discovery of all subclass relationships between class names occurring in an ontology. Discovering these r...
Rob Shearer, Ian Horrocks
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
16 years 22 hour ago
Efficient octilinear Steiner tree construction based on spanning graphs
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Y...
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
15 years 11 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang