Sciweavers

5889 search results - page 1152 / 1178
» Graph Layout Problems
Sort
View
SEMWEB
2009
Springer
15 years 4 months ago
A Database Backend for OWL
Abstract. Most Semantic Web applications are build on top of technology based on the Semantic Web layer cake and the W3C ontology languages RDF(S) and OWL. However RDF(S) embodies ...
Jörg Henss, Joachim Kleb, Stephan Grimm
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 4 months ago
Multilevel Structured Low-Density Parity-Check Codes
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
Nicholas Bonello, Sheng Chen, Lajos Hanzo
ICDM
2008
IEEE
150views Data Mining» more  ICDM 2008»
15 years 4 months ago
Pseudolikelihood EM for Within-network Relational Learning
In this work, we study the problem of within-network relational learning and inference, where models are learned on a partially labeled relational dataset and then are applied to ...
Rongjing Xiang, Jennifer Neville
INFOCOM
2008
IEEE
15 years 4 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
87
Voted
LICS
2008
IEEE
15 years 4 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
« Prev « First page 1152 / 1178 Last » Next »