Sciweavers

55 search results - page 10 / 11
» Proof Granularity as an Empirical Problem
Sort
View
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
11 years 10 months ago
Public-Key Cryptography from New Multivariate Quadratic Assumptions
In this work, we study a new multivariate quadratic (MQ) assumption that can be used to construct public-key encryption schemes. In particular, we research in the following two di...
Yun-Ju Huang, Feng-Hao Liu, Bo-Yin Yang
ECCV
2010
Springer
14 years 29 days ago
A Fast Dual Method for HIK SVM Learning
Histograms are used in almost every aspect of computer vi-4 4 sion, from visual descriptors to image representations. Histogram Inter-5 5 section Kernel (HIK) and SVM classifiers ...
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 2 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
IS
2010
13 years 6 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 1 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn