Sciweavers

97 search results - page 15 / 20
» The Randomness Recycler: A New Technique for Perfect Samplin...
Sort
View
IACR
2011
136views more  IACR 2011»
12 years 6 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
ICALP
2010
Springer
13 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 7 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
VISUALIZATION
1999
IEEE
13 years 11 months ago
Multi-Projector Displays Using Camera-Based Registration
Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering s...
Ramesh Raskar, Michael S. Brown, Ruigang Yang, Wei...
ICSE
2009
IEEE-ACM
14 years 7 months ago
Listening to programmers - Taxonomies and characteristics of comments in operating system code
Innovations from multiple directions have been proposed to improve software reliability. Unfortunately, many of the innovations are not fully exploited by programmers. To bridge t...
Yoann Padioleau, Lin Tan, Yuanyuan Zhou