Sciweavers

940 search results - page 171 / 188
» Rules and Strategies in Java
Sort
View
ICASSP
2011
IEEE
12 years 11 months 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»
12 years 11 months 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
ICASSP
2011
IEEE
12 years 11 months ago
Improved pos tagging for text-to-speech synthesis
One of the fundamental building blocks of text processing for textto-speech (TTS) synthesis is the assignment of a part-of-speech (POS) tag to each input word. POS tags are heavil...
Ming Sun, Jerome R. Bellegarda
CIKM
2011
Springer
12 years 7 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...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 7 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...