Sciweavers

18090 search results - page 555 / 3618
» Computing by Only Observing
Sort
View
FIMI
2003
95views Data Mining» more  FIMI 2003»
15 years 8 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
AAAI
1998
15 years 8 months ago
Iterated Phantom Induction: A Little Knowledge Can Go a Long Way
Weadvance a knowledge-based learning method that augments conventional generalization to permit concept acquisition in failure domains. These are domains in whichlearning must pro...
Mark Brodie, Gerald DeJong
AIPS
2009
15 years 8 months ago
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
Finite-state and memoryless controllers are simple action selection mechanisms widely used in domains such as videogames and mobile robotics. Memoryless controllers stand for func...
Blai Bonet, Héctor Palacios, Hector Geffner
ICASSP
2010
IEEE
15 years 7 months ago
Feedback reduction in MIMO broadcast channels with LMMSE receivers
In this paper we analyze the performance of random beamforming schemes in a multi-user Gaussian broadcast channel. Each user will have N > 1 receive antennas allowing optimal c...
Matthew Pugh, Bhaskar D. Rao
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 7 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler