Sciweavers

34 search results - page 6 / 7
» Approximate K-D Tree Search for Efficient ICP
Sort
View
EMNLP
2009
13 years 6 months ago
Bilingually-Constrained (Monolingual) Shift-Reduce Parsing
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...
Liang Huang, Wenbin Jiang, Qun Liu

Lecture Notes
443views
15 years 6 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 8 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
ICIP
2005
IEEE
14 years 10 months ago
Coarse-level object recognition using interlevel products of complex wavelets
This paper introduces the Interlevel Product (ILP) which is a transform based upon the Dual-Tree Complex Wavelet. Coefficients of the ILP have complex values whose magnitudes indi...
Ryan Anderson, Nick G. Kingsbury, Julien Fauqueur
AI
2002
Springer
13 years 8 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm