9842 search results - page 335 / 1969 » The Complexity of the Matching-Cut Problem |
137
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
136
click to vote
VLSID
2001
IEEE
16 years 4 months ago
2001
IEEE
This paper presents novel techniques for the cycle-accurate power macro-modeling of complex RTL components. The proposed techniques are based on the observation that RTL component...
138
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
109
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...
150
Voted
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale problem involving a large number of process...