Sciweavers

6274 search results - page 341 / 1255
» From query complexity to computational complexity
Sort
View
AINA
2008
IEEE
16 years 1 months ago
Transparently Adding Security Properties to Service Orchestration
In this paper, we present a tool allowing the design of orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an way, as anno...
Stéphanie Chollet, Philippe Lalanda, Andr&e...
159
Voted
ICPR
2008
IEEE
16 years 1 months ago
The Fourier Analysis of 2DT movement with particular reference to hand gesture recognition
This paper describes the mathematical underpinning used to analyse two dimensional movements with time using Fourier Analysis techniques. Interpreting the complex harmonic compone...
Peter R. G. Harding, Tim J. Ellis
ICMLA
2008
15 years 8 months ago
Predicting Algorithm Accuracy with a Small Set of Effective Meta-Features
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
Jun Won Lee, Christophe G. Giraud-Carrier
JCT
2007
83views more  JCT 2007»
15 years 6 months ago
A finiteness theorem for Markov bases of hierarchical models
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimen...
Serkan Hosten, Seth Sullivant
ICASSP
2011
IEEE
14 years 10 months ago
Class of double-talk detectors based on the holder inequality
Most of the echo cancellers are equipped with a double-talk detector (DTD) in order to control the behavior of the adaptive filter during double-talk situations. In this paper, w...
Constantin Paleologu, Jacob Benesty, Tomas Gä...