Sciweavers

2028 search results - page 40 / 406
» Deriving Relation Keys from XML Keys
Sort
View
155
Voted
DAM
2010
107views more  DAM 2010»
15 years 3 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues
CHES
2006
Springer
134views Cryptology» more  CHES 2006»
15 years 7 months ago
Read-Proof Hardware from Protective Coatings
In cryptography it is assumed that adversaries only have black box access to the secret keys of honest parties. In real life, however, the black box approach is not sufficient beca...
Pim Tuyls, Geert Jan Schrijen, Boris Skoric, Jan v...
122
Voted
WWW
2001
ACM
16 years 4 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...
156
Voted
WWW
2010
ACM
15 years 10 months ago
Entity relation discovery from web tables and links
The World-Wide Web consists not only of a huge number of unstructured texts, but also a vast amount of valuable structured data. Web tables [2] are a typical type of structured in...
Cindy Xide Lin, Bo Zhao, Tim Weninger, Jiawei Han,...
131
Voted
ATAL
2003
Springer
15 years 9 months ago
Capturing agent autonomy in roles and XML
A key question in the field of agent-oriented software engineering is how the kind and extent of autonomy owned by computational agents can be appropriately captured. As long as ...
Gerhard Weiß, Michael Rovatsos, Matthias Nic...