Sciweavers

4131 search results - page 194 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
125
Voted
IACR
2011
134views more  IACR 2011»
14 years 3 months ago
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
Dario Catalano, Dario Fiore
131
Voted
CORR
2006
Springer
164views Education» more  CORR 2006»
15 years 3 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
128
Voted
IMPERIAL
1993
15 years 7 months ago
Prioritising Preference Relations
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
Mark Ryan
93
Voted
ICPR
2008
IEEE
15 years 10 months ago
RANSAC-SVM for large-scale datasets
Support Vector Machines (SVMs), though accurate, are still difficult to solve large-scale applications, due to the computational and storage requirement. To relieve this problem,...
Kenji Watanabe, Takio Kurita
120
Voted
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
15 years 8 months ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram