1478 search results - page 243 / 296 » Modular Complexity Analysis via Relative Complexity |
130
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
118
click to vote
GECON
2007
Springer
15 years 4 months ago
2007
Springer
Grid technology offers numerous opportunities for the players involved. Despite the fact that the academic community has already exploited many of them, there is an evident relucta...
143
click to vote
FORMATS
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
100
click to vote
LREC
2010
15 years 3 months ago
2010
With a view to rationalise the evaluation process within the Orange Labs spoken dialogue system projects, a field audit has been realised among the various related professionals. ...
145
Voted
ICONIP
2007
15 years 3 months ago
2007
In the paper we derive and discuss a wide class of algorithms for 3D Super-symmetric nonnegative Tensor Factorization (SNTF) or nonnegative symmetric PARAFAC, and as a special case...