Sciweavers

16430 search results - page 589 / 3286
» On Computable Tree Functions
Sort
View
223
Voted
IJCGA
2006
85views more  IJCGA 2006»
15 years 7 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
ICPR
2010
IEEE
15 years 5 months ago
Fundamental Geodesic Deformations in Spaces of Treelike Shapes
This paper presents a new geometric framework for analysis of planar treelike shapes for applications such as shape matching, recognition and morphology, using the geometry of the...
Aasa Feragen, François Lauze, Mads Nielsen
ACL
2009
15 years 5 months ago
Extending a Surface Realizer to Generate Coherent Discourse
We present a discourse-level Tree Adjoining Grammar which tightly integrates syntax and discourse levels, including a representation for discourse entities. We show that this tech...
Eva Banik
ACL
2011
14 years 10 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
CVPR
2006
IEEE
16 years 9 months ago
Stereo Matching with Symmetric Cost Functions
Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various ...
Kuk-Jin Yoon, In-So Kweon