2430 search results - page 68 / 486 » Computing Tutte Polynomials |
156
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
144
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
121
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
128
Voted
FOCS
2008
IEEE
15 years 2 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
129
click to vote
DAC
2008
ACM
16 years 3 months ago
2008
ACM
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...