Sciweavers

2080 search results - page 164 / 416
» Measuring empirical computational complexity
Sort
View
CIARP
2006
Springer
15 years 8 months ago
A New Approach to Multi-class Linear Dimensionality Reduction
Linear dimensionality reduction (LDR) is quite important in pattern recognition due to its efficiency and low computational complexity. In this paper, we extend the two-class Chern...
Luis Rueda, Myriam Herrera
AAAI
2008
15 years 7 months ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen
129
Voted
ACL
2007
15 years 6 months ago
Mildly Context-Sensitive Dependency Languages
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
Marco Kuhlmann, Mathias Möhl
EACL
2006
ACL Anthology
15 years 6 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
DARE
2000
108views more  DARE 2000»
15 years 6 months ago
Evaluating navigation methods for an AR system
BUILD-IT is a planning tool based on computer vision technology, supporting complex planning and composition tasks. A group of people, seated around a table, interact with objects...
Morten Fjeld