Sciweavers

202 search results - page 31 / 41
» Algorithmic Information Theory and Foundations of Probabilit...
Sort
View
TALG
2010
158views more  TALG 2010»
13 years 3 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
WWW
2003
ACM
14 years 9 months ago
The chatty web: emergent semantics through gossiping
This paper describes a novel approach for obtaining semantic interoperability among data sources in a bottom-up, semiautomatic manner without relying on pre-existing, global seman...
Karl Aberer, Manfred Hauswirth, Philippe Cudr&eacu...
POPL
2007
ACM
14 years 9 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
CIKM
2007
Springer
14 years 2 months ago
Extending query translation to cross-language query expansion with markov chain models
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
Guihong Cao, Jianfeng Gao, Jian-Yun Nie, Jing Bai
KBSE
2010
IEEE
13 years 7 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer