Sciweavers

1525 search results - page 106 / 305
» Matching with Regular Constraints
Sort
View
SIGIR
2006
ACM
15 years 10 months ago
Semantic term matching in axiomatic approaches to information retrieval
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...
Hui Fang, ChengXiang Zhai
DICTA
2003
15 years 5 months ago
A Region-based Matching Approach for 3D-Roof Reconstruction from HR Satellite Stereo Pairs
This study is a part of a global project on urban scenes interpretation using high resolution satellite images. Actually, the research is focused on buildings and roads are used to...
Nesrine Chehata, Franck Jung, Marc Pierrot Deseill...
STACS
2009
Springer
15 years 10 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
ICASSP
2009
IEEE
15 years 10 months ago
LSH banding for large-scale retrieval with memory and recall constraints
Locality Sensitive Hashing (LSH) is widely used for efficient retrieval of candidate matches in very large audio, video, and image systems. However, extremely large reference dat...
Michele Covell, Shumeet Baluja
137
Voted
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 4 months ago
Rate and power allocation under the pairwise distributed source coding constraint
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
Shizheng Li, Aditya Ramamoorthy