923 search results - page 61 / 185 » On a generalization of Stickelberger's Theorem |
197
click to vote
DM
2011
15 years 1 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
239
click to vote
SCP
2011
15 years 1 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
196
click to vote
TEC
2010
15 years 27 days ago
2010
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
196
click to vote
CORR
2011
Springer
15 years 20 days ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
200
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...