Sciweavers

232 search results - page 39 / 47
» Large-scale Boolean matching
Sort
View
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
15 years 4 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
WWW
2008
ACM
15 years 10 months ago
Online learning from click data for sponsored search
Sponsored search is one of the enabling technologies for today's Web search engines. It corresponds to matching and showing ads related to the user query on the search engine...
Massimiliano Ciaramita, Vanessa Murdock, Vassilis ...
108
Voted
WWW
2009
ACM
15 years 4 months ago
A game based approach to assign geographical relevance to web images
Geographical context is very important for images. Millions of images on the Web have been already assigned latitude and longitude information. Due to the rapid proliferation of s...
Yuki Arase, Xing Xie, Manni Duan, Takahiro Hara, S...
MM
2006
ACM
168views Multimedia» more  MM 2006»
15 years 3 months ago
Scalability of local image descriptors: a comparative study
Computer vision researchers have recently proposed several local descriptor schemes. Due to lack of database support, however, these descriptors have only been evaluated using sma...
Herwig Lejsek, Friðrik Heiðar Ásmun...
ICDCS
2005
IEEE
15 years 3 months ago
Comparison of Approaches to Service Deployment
IT today is driven by the trend of increasing scale and complexity. Utility and Grid computing models, PlanetLab, and traditional data centers, are reaching the scale of thousands...
Vanish Talwar, Qinyi Wu, Calton Pu, Wenchang Yan, ...