Sciweavers

355 search results - page 39 / 71
» A New Approximation Technique for Resource-Allocation Proble...
Sort
View
ICDE
2002
IEEE
91views Database» more  ICDE 2002»
15 years 4 months ago
Lossy Reduction for Very High Dimensional Data
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
Chris Jermaine, Edward Omiecinski
SIGGRAPH
1995
ACM
15 years 3 months ago
Image metamorphosis using snakes and free-form deformations
This paper presents new solutions to the following three problems in image morphing: feature specification, warp generation, and transition control. To reduce the burden of featu...
Seungyong Lee, Kyung-Yong Chwa, Sung Yong Shin
ACISP
2004
Springer
15 years 5 months ago
Weak Property of Malleability in NTRUSign
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
SungJun Min, Go Yamamoto, Kwangjo Kim
JCSS
2008
138views more  JCSS 2008»
14 years 11 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
TCS
2010
14 years 6 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee