Sciweavers

3616 search results - page 493 / 724
» Conditional Memory Ordering
Sort
View
AAAI
2008
15 years 5 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
AAAI
2008
15 years 5 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
123
Voted
CIA
2008
Springer
15 years 5 months ago
Filter Allocation Using Iterative ECNP
Network devices can filter traffic in order to protect end-user computers against network worms and other threats. Since these devices have very limited memories and cannot deploy ...
Jan Tozicka, Stepán Urban, Magdalena Prokop...
CIKM
2008
Springer
15 years 5 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
15 years 5 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane