2723 search results - page 13 / 545 » Learning lexicographic orders |
MOC
2002
13 years 7 months ago
2002
It is well-known, that the ring C[X1, . . . , Xn]An of polynomial invariants of the alternating group An has no finite SAGBI basis with respect to the lexicographical order for any...
JGO
2011
13 years 2 months ago
2011
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
ML
2007
ACM
13 years 6 months ago
2007
ACM
DCC
2010
IEEE
14 years 2 months ago
2010
IEEE
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
DAM
2007
13 years 7 months ago
2007
This work describes a study on the generation of bicliques of a graph. We show that it is NP-complete to test whether a subset of the vertices of a graph is part of a biclique. We ...