Sciweavers

4926 search results - page 887 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CVPR
2011
IEEE
13 years 5 months ago
Sparsity-based Image Denoising via Dictionary Learning and Structural Clustering
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...
Weisheng Dong, Xin Li
PODC
2012
ACM
11 years 10 months ago
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
James Aspnes
NGC
2006
Springer
13 years 7 months ago
Story Planning as Exploratory Creativity: Techniques for Expanding the Narrative Search Space
The authoring of fictional stories is considered a creative process. The purpose of most story authoring is not to invent a new style or genre of story that will be accepted by the...
Mark O. Riedl, R. Michael Young
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 3 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori