Sciweavers

3071 search results - page 185 / 615
» Explanatory Design Theory
Sort
View
DM
2010
85views more  DM 2010»
14 years 11 months ago
Hamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
Robert F. Bailey, Brett Stevens
DAM
2000
84views more  DAM 2000»
14 years 10 months ago
Three-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
Peter Eades, Antonios Symvonis, Sue Whitesides
ARTMED
1998
98views more  ARTMED 1998»
14 years 10 months ago
Dependency parsing for medical language and concept representation
Abstract: The theory of conceptual structures serves as a common basis for natural language processing and medical concept representation. We present a PROLOG-based formalization o...
Friedrich Steimann
MOBIHOC
2009
ACM
15 years 11 months ago
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
Dezun Dong, Yunhao Liu, Xiangke Liao
FPGA
2007
ACM
142views FPGA» more  FPGA 2007»
15 years 5 months ago
Parametric yield in FPGAs due to within-die delay variations: a quantitative analysis
Variations in the semiconductor fabrication process results in variability in parameters between transistors on the same die, a problem exacerbated by lithographic scaling. The re...
N. Pete Sedcole, Peter Y. K. Cheung