Sciweavers

330 search results - page 64 / 66
» Algorithms for Propositional Model Counting
Sort
View
ICAI
2010
13 years 6 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang
WWW
2009
ACM
14 years 9 months ago
Extracting community structure through relational hypergraphs
Social media websites promote diverse user interaction on media objects as well as user actions with respect to other users. The goal of this work is to discover community structu...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 9 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
PPOPP
2010
ACM
14 years 3 months ago
Load balancing on speed
To fully exploit multicore processors, applications are expected to provide a large degree of thread-level parallelism. While adequate for low core counts and their typical worklo...
Steven Hofmeyr, Costin Iancu, Filip Blagojevic
FOCS
2009
IEEE
14 years 3 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu