Sciweavers

2588 search results - page 411 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
SPAA
2006
ACM
15 years 5 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
ACMSE
2006
ACM
15 years 3 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 5 days 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...
DIMEA
2007
132views Multimedia» more  DIMEA 2007»
15 years 1 months ago
On the production of creative subjectivity
Businesses today are requiring higher levels of creativity and innovation in the face of rapid change, fierce competition and increasingly complex markets. Nowhere is the more obv...
Brett Rolfe
136
Voted
AAMAS
2005
Springer
14 years 11 months ago
Cooperative Multi-Agent Learning: The State of the Art
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
Liviu Panait, Sean Luke