Sciweavers

1983 search results - page 147 / 397
» Competitive graph searches
Sort
View
CIVR
2010
Springer
276views Image Analysis» more  CIVR 2010»
14 years 24 days ago
Optimizing visual search with implicit user feedback in interactive video retrieval
This paper describes an approach to optimize query by visual example results, by combining visual features and implicit user feedback in interactive video retrieval. To this end, ...
Stefanos Vrochidis, Ioannis Kompatsiaris, Ioannis ...
SIGIR
2010
ACM
13 years 12 months ago
The importance of anchor text for ad hoc search revisited
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...
Marijn Koolen, Jaap Kamps
MM
2010
ACM
204views Multimedia» more  MM 2010»
13 years 8 months ago
Crew: cross-modal resource searching by exploiting wikipedia
In Web 2.0, users have generated and shared massive amounts of resources in various media formats, such as news, blogs, audios, photos and videos. The abundance and diversity of t...
Chen Liu, Beng Chin Ooi, Anthony K. H. Tung, Dongx...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 2 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
EJC
2006
13 years 8 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer