Sciweavers

4908 search results - page 817 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
LREC
2010
136views Education» more  LREC 2010»
15 years 8 months ago
LoonyBin: Keeping Language Technologists Sane through Automated Management of Experimental (Hyper)Workflows
Many contemporary language technology systems are characterized by long pipelines of tools with complex dependencies. Too often, these workflows are implemented by ad hoc scripts;...
Jonathan H. Clark, Alon Lavie
MEDIAFORENSICS
2010
15 years 8 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
FORTE
2007
15 years 8 months ago
The DHCP Failover Protocol: A Formal Perspective
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...
Rui Fan, Ralph E. Droms, Nancy D. Griffeth, Nancy ...
ICWS
2007
IEEE
15 years 8 months ago
A Query-based System for Automatic Invocation of Web Services
There is a critical need to design and develop tools tract away the fundamental complexity of XML based Web services specifications and toolkits, and provide an elegant, intuitive...
Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, ...
IMECS
2007
15 years 8 months ago
Approaches to an Adaptive Middleware for Mobile Services
Abstract—Adaptive middleware and wireless networks are hot topics in many discussions today. Literature describes a lot of approaches which are based upon existing middleware tec...
Ulrich Dümichen, Uwe Baumgarten