Sciweavers

4541 search results - page 96 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
172
Voted
PODC
2011
ACM
14 years 5 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...
129
Voted
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 5 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
126
Voted
ICML
2009
IEEE
16 years 3 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji
121
Voted
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 23 days ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
ICML
2007
IEEE
16 years 3 months ago
Bottom-up learning of Markov logic network structure
Markov logic networks (MLNs) are a statistical relational model that consists of weighted firstorder clauses and generalizes first-order logic and Markov networks. The current sta...
Lilyana Mihalkova, Raymond J. Mooney