Sciweavers

967 search results - page 6 / 194
» Building a Calculus of Data Structures
Sort
View
WWW
2007
ACM
15 years 10 months ago
Collaboratively Building Structured Knowledge with DBin: From del.icio.us Tags to an "RDFS Folksonomy"
DBin is a Semantic Web application that enables groups of users with a common interest to cooperatively create semantically structured knowledge bases. These user groups, which we...
Giovanni Tummarello, Christian Morbidoni
WWW
2004
ACM
15 years 10 months ago
Ontological representation of learning objects: building interoperable vocabulary and structures
The ontological representation of learning objects is a way to deal with the interoperability and reusability of learning objects (including metadata) through providing a semantic...
Jian Qin, Naybell Hernández
CONCUR
2006
Springer
15 years 1 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
INFOCOM
2010
IEEE
14 years 8 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
174
Voted
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
15 years 11 months ago
Algebraic Signatures for Scalable Distributed Data Structures
Signatures detect changes to the data objects. Numerous schemes a known, e.g., the popular hash based SHA-1 standard. We propose a nov scheme we call algebraic signatures. We use ...
Witold Litwin, Thomas J. E. Schwarz