Sciweavers

821 search results - page 95 / 165
» Addressing the Petersen graph
Sort
View
SEMWEB
2007
Springer
15 years 6 months ago
Logical Foundations of (e)RDF(S): Complexity and Reasoning
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
Jos de Bruijn, Stijn Heymans
WADS
2007
Springer
101views Algorithms» more  WADS 2007»
15 years 6 months ago
Edges and Switches, Tunnels and Bridges
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
David Eppstein, Marc J. van Kreveld, Elena Mumford...
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
15 years 5 months ago
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
CAIP
2005
Springer
114views Image Analysis» more  CAIP 2005»
15 years 5 months ago
A Segmentation Algorithm for Noisy Images
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
Soufiane Rital, Hocine Cherifi, Serge Miguet
PAM
2005
Springer
15 years 5 months ago
Revisiting Internet AS-Level Topology Discovery
Abstract. The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived f...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, G...