Sciweavers

4110 search results - page 743 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
145
Voted
TEC
2010
77views more  TEC 2010»
14 years 10 months ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader
CVPR
2009
IEEE
16 years 11 months ago
Vocabulary Hierarchy Optimization for Effective and Transferable Retrieval
Scalable image retrieval systems usually involve hierarchical quantization of local image descriptors, which produces a visual vocabulary for inverted indexing of images. Although ...
Rongrong Ji (Harbin Institute of Technology), Xing...
DAC
2002
ACM
16 years 5 months ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
WWW
2008
ACM
16 years 4 months ago
Learning multiple graphs for document recommendations
The Web offers rich relational data with different semantics. In this paper, we address the problem of document recommendation in a digital library, where the documents in questio...
Ding Zhou, Shenghuo Zhu, Kai Yu, Xiaodan Song, Bel...
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
16 years 4 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...