19866 search results - page 7 / 3974 » Computing all factorizations in *** |
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
129
click to vote
CLUSTER
2011
IEEE
13 years 9 months ago
2011
IEEE
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
ARSCOM
2004
14 years 9 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
SODA
1990
ACM
14 years 10 months ago
1990
ACM
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
39
Voted
COLING
2010
14 years 4 months ago
2010
PanLex is a lemmatic translation resource which combines a large number of translation dictionaries and other translingual lexical resources. It currently covers 1353 language var...