Sciweavers

4229 search results - page 779 / 846
» On the Optimality of Spiral Search
Sort
View
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 5 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
MM
2006
ACM
189views Multimedia» more  MM 2006»
15 years 5 months ago
Real-time computerized annotation of pictures
Automated annotation of digital pictures has been a highly challenging problem for computer scientists since the invention of computers. The capability of annotating pictures by c...
Jia Li, James Ze Wang
MM
2006
ACM
180views Multimedia» more  MM 2006»
15 years 5 months ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang
SIGIR
2006
ACM
15 years 5 months ago
Adapting ranking SVM to document retrieval
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must ...
Yunbo Cao, Jun Xu, Tie-Yan Liu, Hang Li, Yalou Hua...
HPDC
2005
IEEE
15 years 4 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant