Sciweavers

1656 search results - page 55 / 332
» Labeling Schemes with Queries
Sort
View
CN
2006
85views more  CN 2006»
13 years 9 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
ALT
1998
Springer
14 years 1 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ACL
2001
13 years 10 months ago
From Chunks to function-Argument Structure: A Similarity-Based Approach
Chunk parsing has focused on the recognition of partial constituent structures at the level of individual chunks. Little attention has been paid to the question of how such partia...
Sandra Kübler, Erhard W. Hinrichs
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
14 years 10 months ago
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peerto-Peer systems....
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu, Rong...
APPINF
2003
13 years 10 months ago
A Comparison of Structure-generic Relational Storage Schemes of XML Data
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
Weining Zhang, Douglas Pollok