9842 search results - page 1445 / 1969 » The Complexity of the Matching-Cut Problem |
183
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
218
click to vote
IV
2009
IEEE
16 years 1 months ago
2009
IEEE
Aesthetics is an unsolved problem of information visualization, because there is no satisfactory understanding of what constitutes aesthetic effect. This survey paper gives an ove...
182
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
181
click to vote
WAW
2009
Springer
16 years 1 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
307
click to vote
ECOWS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract—In this paper, we address the problem of selfadaptation in internet-scale service-oriented systems. Services need to adapt by select the best neighboring services solely...