600 search results - page 71 / 120 » Problems and results in extremal combinatorics - II |
129
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
122
click to vote
ICSE
2011
IEEE-ACM
14 years 4 months ago
2011
IEEE-ACM
A dependability case is an explicit, end-to-end argument, based on concrete evidence, that a system satisfies a critical property. We report on a case study constructing a depend...
DAC
2006
ACM
16 years 2 months ago
2006
ACM
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
117
click to vote
CVPR
2000
IEEE
16 years 3 months ago
2000
IEEE
In this paper we present a novel approach to estimate and analyze 3D uid structure and motion of clouds from multi-spectrum 2D cloud image sequences. Accurate cloud-top structure ...
132
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...