Sciweavers

2503 search results - page 469 / 501
» A study of 3-arc graphs
Sort
View
DIS
2006
Springer
13 years 11 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
ECAI
2006
Springer
13 years 11 months ago
Resolving Conflicts in Action Descriptions
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
KONVENS
2000
13 years 11 months ago
The RWTH Large Vocabulary Speech Recognition System for Spontaneous Speech
This paper presents details of the RWTH large vocabulary continuous speech recognition system used in the VERBMOBIL spontaneous speech translation system. In particular, we report...
Stephan Kanthak, Sirko Molau, Achim Sixtus, Ralf S...
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
24
Voted
CCS
2010
ACM
13 years 11 months ago
Towards publishing recommendation data with predictive anonymization
Recommender systems are used to predict user preferences for products or services. In order to seek better prediction techniques, data owners of recommender systems such as Netfli...
Chih-Cheng Chang, Brian Thompson, Hui (Wendy) Wang...