Sciweavers

699 search results - page 84 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
ICFP
2008
ACM
15 years 9 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
SIGGRAPH
1992
ACM
15 years 1 months ago
Measuring and modeling anisotropic reflection
A new device for measuringthe spatial reflectancedistributionsof surfaces is introduced, along with a new mathematical model of sniaorropic reflectance. The reflectance model pres...
Gregory J. Ward
CODASPY
2012
13 years 5 months ago
Comparison-based encryption for fine-grained access control in clouds
Access control is one of the most important security mechanisms in cloud computing. However, there has been little work that explores various comparison-based constraints for regu...
Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Mengyang Yu, H...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...