Sciweavers

2938 search results - page 303 / 588
» On obfuscating point functions
Sort
View
SIGMOD
2007
ACM
133views Database» more  SIGMOD 2007»
16 years 6 months ago
Making database systems usable
Database researchers have striven to improve the capability of a database in terms of both performance and functionality. We assert that the usability of a database is as importan...
H. V. Jagadish, Adriane Chapman, Aaron Elkiss, Mag...
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Procedural Generation of Roads
In this paper, we propose an automatic method for generating roads based on a weighted anisotropic shortest path algorithm. Given an input scene, we automatically create a path co...
Eric Galin, Adrien Peytavie, Nicolas Maréchal, Er...
CVPR
2010
IEEE
16 years 3 months ago
Coded Exposure Imaging for Projective Motion Deblurring
We propose a method for deblurring of spatially variant object motion. A principal challenge of this problem is how to estimate the point spread function (PSF) of the spatially va...
Yu-Wing Tai, Naejin Kong, Stephen Lin, Sung Yong S...
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
16 years 1 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
GLOBECOM
2009
IEEE
16 years 1 months ago
Coding Versus ARQ in Fading Channels: How Reliable Should the PHY Be?
—This paper studies the tradeoff between channel coding and ARQ (automatic repeat request) in Rayleigh blockfading channels. A heavily coded system corresponds to a low transmiss...
Peng Wu, Nihar Jindal