Sciweavers

1404 search results - page 253 / 281
» Complexity of admissible rules
Sort
View
PRL
2010
209views more  PRL 2010»
13 years 3 months ago
Efficient update of the covariance matrix inverse in iterated linear discriminant analysis
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
Jan Salmen, Marc Schlipsing, Christian Igel
ICASSP
2011
IEEE
13 years 10 days ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
ANOR
2011
117views more  ANOR 2011»
13 years 7 days ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ICMT
2011
Springer
13 years 2 days ago
A Demonstration-based Approach to Support Live Transformations in a Model Editor
Complex model editing activities are frequently performed to realize various model evolution tasks (e.g., model scalability, weaving aspects into models, and model refactoring). In...
Yu Sun, Jeff Gray, Christoph Wienands, Michael Gol...
CIKM
2011
Springer
12 years 8 months ago
Fact-based question decomposition for candidate answer re-ranking
Factoid questions often contain one or more assertions (facts) about their answers. However, existing question-answering (QA) systems have not investigated how the multiple facts ...
Aditya Kalyanpur, Siddharth Patwardhan, Branimir B...