Sciweavers

237 search results - page 18 / 48
» Practical and Optimal String Matching
Sort
View
CIIA
2009
13 years 8 months ago
Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
Bilal Benmessahel, Mohamed Touahria
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
14 years 29 days ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
ICCV
2001
IEEE
14 years 9 months ago
Stereo Matching by Compact Windows via Minimum Ratio Cycle
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
Olga Veksler
WCE
2007
13 years 8 months ago
Transformation Model Estimation for Point Matching Via Gaussian Processes
—One of main issues in point matching is the choice of the mapping function and the computation of its optimal hyperparameters. In this paper, we propose an attractive approach t...
Xin Yu, Jin-Wen Tian, Jian Liu
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz