Sciweavers

206 search results - page 12 / 42
» Efficient adaptive collect using randomization
Sort
View
LREC
2010
155views Education» more  LREC 2010»
13 years 10 months ago
Efficient Minimal Perfect Hash Language Models
The recent availability of large collections of text such as the Google 1T 5-gram corpus (Brants and Franz, 2006) and the Gigaword corpus of newswire (Graff, 2003) have made it po...
David Guthrie, Mark Hepple, Wei Liu
ATAL
2008
Springer
13 years 10 months ago
Decentralised Structural Adaptation in Agent Organisations
Abstract. Autonomic computing is being advocated as a tool for maintaining and managing large, complex computing systems. Self-organising multi-agent systems provide a suitable par...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
TIP
2010
137views more  TIP 2010»
13 years 3 months ago
Adaptive Langevin Sampler for Separation of t-Distribution Modelled Astrophysical Maps
We propose to model the image differentials of astrophysical source maps by Student's t-distribution and to use them in the Bayesian source separation method as priors. We int...
Koray Kayabol, Ercan E. Kuruoglu, José Luis...
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 24 days ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
FLAIRS
2006
13 years 10 months ago
Agile Sensor Networks: Adaptive Coverage via Mobile Nodes
Advances in sensing and communication technology make sensor networks a convenient and cost effective tool for collecting data in hard to reach and hazardous areas Increasingly, s...
Swapna Ghanekar, Fatma Mili, Imad Elhajj