Sciweavers

1376 search results - page 210 / 276
» Searching Trees: An Essay
Sort
View
PVLDB
2010
101views more  PVLDB 2010»
15 years 1 months ago
InZeit: Efficiently Identifying Insightful Time Points
Web archives are useful resources to find out about the temporal evolution of persons, organizations, products, or other topics. However, even when advanced text search functional...
Vinay Setty, Srikanta J. Bedathur, Klaus Berberich...
ACL
2011
14 years 10 months ago
Binarized Forest to String Translation
Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
Hao Zhang, Licheng Fang, Peng Xu, Xiaoyun Wu
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 8 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 8 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
CVPR
1998
IEEE
16 years 8 months ago
An Optimized Interaction Strategy for Bayesian Relevance Feedback
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]....
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka...