Sciweavers

234 search results - page 45 / 47
» An Introduction to Binary Search Trees and Balanced Trees
Sort
View
KR
2004
Springer
15 years 11 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
RTAS
1997
IEEE
15 years 10 months ago
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating bet...
Sung-Whan Moon, Kang G. Shin, Jennifer Rexford
CIKM
2007
Springer
16 years 4 days ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
TIP
2002
105views more  TIP 2002»
15 years 5 months ago
Tree-structured method for LUT inverse halftoning and for image halftoning
1 Recently the authors proposed a Look Up Table (LUT) based method for inverse halftoning of images. The LUT for inverse halftoning is obtained from the histogram gathered from a f...
Murat Mese, Palghat P. Vaidyanathan
DDECS
2007
IEEE
175views Hardware» more  DDECS 2007»
16 years 9 days 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...