Sciweavers

1342 search results - page 78 / 269
» Descriptor Learning for Efficient Retrieval
Sort
View
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 3 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
CVPR
2008
IEEE
16 years 5 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch
110
Voted
WWW
2007
ACM
16 years 4 months ago
Efficient search engine measurements
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
Ziv Bar-Yossef, Maxim Gurevich
IDEAS
2009
IEEE
232views Database» more  IDEAS 2009»
15 years 10 months ago
RDFKB: efficient support for RDF inference queries and knowledge management
RDFKB (Resource Description Framework Knowledge Base) is a relational database system for RDF datasets which supports inference and knowledge management. Significant research has ...
James P. McGlothlin, Latifur R. Khan
CIKM
2009
Springer
15 years 7 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...