Sciweavers

3055 search results - page 433 / 611
» Randomized Search Trees
Sort
View
PVLDB
2010
101views more  PVLDB 2010»
14 years 11 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 8 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 6 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
ECCV
2006
Springer
16 years 6 months ago
TextonBoost: Joint Appearance, Shape and Context Modeling for Multi-class Object Recognition and Segmentation
Abstract. This paper proposes a new approach to learning a discriminative model of object classes, incorporating appearance, shape and context information efficiently. The learned ...
Jamie Shotton, John M. Winn, Carsten Rother, Anton...
ECCV
2008
Springer
16 years 2 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee