Sciweavers

2373 search results - page 243 / 475
» On the Theory of Structural Subtyping
Sort
View
PODS
2003
ACM
135views Database» more  PODS 2003»
16 years 6 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
175
Voted
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 6 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
LATA
2010
Springer
16 years 1 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
LICS
2009
IEEE
16 years 1 months ago
Indexed Containers
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Thorsten Altenkirch, Peter Morris
HICSS
2007
IEEE
164views Biometrics» more  HICSS 2007»
16 years 1 months ago
Supporting Knowledge Transfer through Decomposable Reasoning Artifacts
Technology to support knowledge transfer and cooperative inquiry must offer its users the ability to effectively interpret knowledge structures produced by collaborators. Communic...
William Pike, Richard May, Alan Turner