Sciweavers

477 search results - page 74 / 96
» Storing RDF as a Graph
Sort
View
ICDCSW
2009
IEEE
14 years 4 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
14 years 4 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
SMI
2008
IEEE
110views Image Analysis» more  SMI 2008»
14 years 4 months ago
OCTOR: OCcurrence selecTOR in pattern hierarchies
Hierarchies of patterns of features, of sub-assemblies, or of CSG sub-expressions are used in architectural and mechanical CAD to eliminate laborious repetitions from the design p...
Justin Jang, Jarek Rossignac
PODC
2003
ACM
14 years 3 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
VLDB
1998
ACM
144views Database» more  VLDB 1998»
14 years 2 months ago
Proximity Search in Databases
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas...