Sciweavers

1778 search results - page 296 / 356
» The Theory of Probabilistic Databases
Sort
View
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
15 years 10 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
IUI
2010
ACM
15 years 6 months ago
Facilitating exploratory search by model-based navigational cues
We present an extension of a computational cognitive model of social tagging and exploratory search called the semantic imitation model. The model assumes a probabilistic represen...
Wai-Tat Fu, Thomas George Kannampallil, Ruogu Kang
ATAL
2009
Springer
15 years 4 months ago
Increasing the expressiveness of virtual agents: autonomous generation of speech and gesture for spatial description tasks
Embodied conversational agents are required to be able to express themselves convincingly and autonomously. Based on an empirial study on spatial descriptions of landmarks in dire...
Kirsten Bergmann, Stefan Kopp
ATAL
2009
Springer
15 years 4 months ago
A memetic framework for describing and simulating spatial prisoner's dilemma with coalition formation
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...
Juan C. Burguillo-Rial