Sciweavers

32028 search results - page 146 / 6406
» Experimenting a
Sort
View
WEA
2009
Springer
123views Algorithms» more  WEA 2009»
16 years 1 months ago
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...
Hannes Moser, Rolf Niedermeier, Manuel Sorge
IAT
2009
IEEE
16 years 1 months ago
Multilingual Statistical News Summarisation: Preliminary Experiments with English
—In this paper we present a generic approach for summarising multilingual news clusters such as the ones produced by the Europe Media Monitor (EMM) system. It is generic because ...
Mijail Alexandrov Kabadjov, Josef Steinberger, Bru...
ICAC
2009
IEEE
16 years 1 months ago
Experiences with scheduling and mapping games for adaptive distributed systems: summary
We apply the concept of “games with a purpose” to NPcomplete mapping and scheduling problems in distributed systems and report our experiences. The particular context is a sch...
Bin Lin, Peter A. Dinda
ICASSP
2009
IEEE
16 years 1 months ago
Experimenting with a global decision tree for state clustering in automatic speech recognition systems
In modern automatic speech recognition systems, it is standard practice to cluster several logical hidden Markov model states into one physical, clustered state. Typically, the cl...
Jasha Droppo, Alex Acero
SEMCO
2009
IEEE
16 years 1 months ago
Ontology Extraction from Existing Educational Content to Improve Personalized e-Learning Experiences
Nowadays, the use of domain ontologies in e-Learning applications is rapidly increasing due to the important role they play in knowledge representation, sharing of didactical mate...
Nicola Capuano, Luca Dell'Angelo, Francesco Orciuo...