Sciweavers

1066 search results - page 41 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
ICPPW
2005
IEEE
15 years 3 months ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde
MVA
2010
130views Computer Vision» more  MVA 2010»
14 years 8 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh
66
Voted
DCC
2005
IEEE
15 years 9 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
15 years 1 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut
LPAR
1994
Springer
15 years 1 months ago
On Anti-Links
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
Bernard Becker, Reiner Hähnle, Anavai Ramesh,...