Sciweavers

727 search results - page 71 / 146
» Private approximation of search problems
Sort
View
CVPR
2004
IEEE
15 years 22 hour ago
The SPS Algorithm: Patching Figural Continuity and Transparency by Split-Patch Search
This paper describes a novel algorithm for the efficient synthesis of high-quality virtual views from only two input images. The emphasis is on the recovery of continuity of objec...
Antonio Criminisi, Andrew Blake
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 11 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 10 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
KCAP
2005
ACM
14 years 3 months ago
Indirect anaphora resolution as semantic path search
Anaphora occur commonly in natural language text, and resolving them is essential for capturing the knowledge encoded in text. Indirect anaphora are especially challenging to reso...
James Fan, Ken Barker, Bruce W. Porter
SARA
2009
Springer
14 years 2 months ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne