Sciweavers

4791 search results - page 394 / 959
» Clustering with partial information
Sort
View
CSUR
1999
114views more  CSUR 1999»
15 years 7 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
MCS
2008
Springer
15 years 7 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich
IFIP
2010
Springer
15 years 2 months ago
Modular Plans for Secure Service Composition
Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from ...
Gabriele Costa, Pierpaolo Degano, Fabio Martinelli
INTERSPEECH
2010
15 years 2 months ago
Similarity scoring for recognizing repeated out-of-vocabulary words
We develop a similarity measure to detect repeatedly occurring Out-of-Vocabulary words (OOV), since these carry important information. Sub-word sequences in the recognition output...
Mirko Hannemann, Stefan Kombrink, Martin Karafi&aa...
WWW
2006
ACM
16 years 8 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...