Sciweavers

3096 search results - page 532 / 620
» Theory and Use of the EM Algorithm
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 9 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
CADE
2005
Springer
14 years 9 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
MOBIHOC
2005
ACM
14 years 8 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
ATAL
2009
Springer
14 years 3 months ago
First principles planning in BDI systems
BDI (Belief, Desire, Intention) agent systems are very powerful, but they lack the ability to incorporate planning. There has been some previous work to incorporate planning withi...
Lavindra de Silva, Sebastian Sardiña, Lin P...