19866 search results - page 101 / 3974 » Computing all factorizations in *** |
182
click to vote
AAECC
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
167
click to vote
NAACL
2010
15 years 4 months ago
2010
In this work, we try a hybrid methodology for language modeling where both morphological decomposition and factored language modeling (FLM) are exploited to deal with the complex ...
188
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Low-rank matrix approximation methods provide one of the simplest and most effective approaches to collaborative filtering. Such models are usually fitted to data by finding a MAP...
189
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
212
click to vote
DAWAK
2004
Springer
16 years 7 days ago
2004
Springer
Clustering is an important data mining problem. However, most earlier work on clustering focused on numeric attributes which have a natural ordering to their attribute values. Rec...