Sciweavers

213 search results - page 38 / 43
» An Approximation Algorithm for Binary Searching in Trees
Sort
View
VLSID
2005
IEEE
97views VLSI» more  VLSID 2005»
14 years 1 months ago
Q-PREZ: QBF Evaluation Using Partition, Resolution and Elimination with ZBDDs
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
Kameshwar Chandrasekar, Michael S. Hsiao
ISVC
2005
Springer
14 years 1 months ago
Retinal Image Registration for NIH's ETDRS
This paper presents a retinal image registration approach for National Institute of Health (NIH)’s Early Treatment Diabetic Retinopathy Study (ETDRS) standard. The ETDRS imaging ...
Thitiporn Chanwimaluang, Guoliang Fan
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 7 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro
DDECS
2007
IEEE
175views Hardware» more  DDECS 2007»
14 years 2 months ago
Analyzing Test and Repair Times for 2D Integrated Memory Built-in Test and Repair
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...
KR
2004
Springer
14 years 1 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner