Sciweavers

849 search results - page 65 / 170
» Completely Non-malleable Schemes
Sort
View
IOR
2010
161views more  IOR 2010»
15 years 4 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
ECCV
2004
Springer
16 years 8 months ago
Matching Tensors for Automatic Correspondence and Registration
Abstract. Complete 3-D modeling of a free-form object requires acquisition from multiple view-points. These views are then required to be registered in a common coordinate system b...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens
ICFP
2009
ACM
16 years 7 months ago
Scribble: closing the book on ad hoc documentation tools
Scribble is a system for writing library documentation, user guides, and tutorials. It builds on PLT Scheme's technology for language extension, and at its heart is a new app...
Matthew Flatt, Eli Barzilay, Robert Bruce Findler
VLSID
2004
IEEE
168views VLSI» more  VLSID 2004»
16 years 6 months ago
VLSI Implementation of Visible Watermarking for a Secure Digital Still Camera Design
Watermarking is the process that embeds data called a watermark into a multimedia object for its copyright protection. The digital watermarks can be visible to a viewer on careful...
Saraju P. Mohanty, Nagarajan Ranganathan, Ravi Nam...
SIGMOD
2007
ACM
111views Database» more  SIGMOD 2007»
16 years 6 months ago
Query relaxation using malleable schemas
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, Wolfgan...