Sciweavers

1651 search results - page 213 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ADC
2008
Springer
139views Database» more  ADC 2008»
14 years 2 months ago
Computing Structural Similarity of Source XML Schemas against Domain XML Schema
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Jixue Liu...
APCCAS
2006
IEEE
323views Hardware» more  APCCAS 2006»
14 years 2 months ago
Real-Time Implementation of a Particle Filter with Integrated Voice Activity Detector for Acoustic Speaker Tracking
— In noisy and reverberant environments, the problem of acoustic source localisation and tracking (ASLT) using an array of microphones presents a number of challenging difficult...
Anders M. Johansson, Eric A. Lehmann, Sven Nordhol...
ICALP
2010
Springer
13 years 10 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
DEXA
2008
Springer
87views Database» more  DEXA 2008»
13 years 10 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...
IPL
2002
65views more  IPL 2002»
13 years 7 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba