Sciweavers

803 search results - page 57 / 161
» Independence in Direct-Product Graphs
Sort
View
95
Voted
SEMWEB
2001
Springer
15 years 5 months ago
On the Integration of Topic Maps and RDF data
Abstract. Topic Maps and RDF are two independently developed paradigms and standards for the representation, interchange, and exploitation of model-based data on the web. Each para...
Martin S. Lacher, Stefan Decker
108
Voted
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
15 years 2 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
133
Voted
DAGSTUHL
2006
15 years 2 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
IWQOS
2005
Springer
15 years 6 months ago
Overlay Networks with Linear Capacity Constraints
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
Ying Zhu, Baochun Li
97
Voted
ISIPTA
2003
IEEE
15 years 6 months ago
Graphical Representation of Asymmetric Graphoid Structures
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...
Barbara Vantaggi