Sciweavers

831 search results - page 101 / 167
» Coalgebraic Correspondence Theory
Sort
View
WWW
2004
ACM
16 years 16 days ago
Experiments with persian text compression for web
The increasing importance of Unicode for text encoding implies a possible doubling of data storage space and data transmission time, with a corresponding need for data compression...
Farhad Oroumchian, Ehsan Darrudi, Fattane Taghiyar...
WWW
2001
ACM
16 years 16 days ago
Algorithms and programming models for efficient representation of XML for Internet applications
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
Neel Sundaresan, Reshad Moussa
POPL
2007
ACM
16 years 5 days ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
POPL
2004
ACM
16 years 5 days ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 16 hour ago
Preservation of proximity privacy in publishing numerical sensitive data
We identify proximity breach as a privacy threat specific to numerical sensitive attributes in anonymized data publication. Such breach occurs when an adversary concludes with hig...
Jiexing Li, Yufei Tao, Xiaokui Xiao