Sciweavers

2996 search results - page 228 / 600
» Numberings and Randomness
Sort
View
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
16 years 28 days ago
Latency Analysis of Coalescence for Robot Groups
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
Sameera Poduri, Gaurav S. Sukhatme
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
15 years 8 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
IFIP
2004
Springer
15 years 12 months ago
Solving Geometrical Place Problems by using Evolutionary Algorithms
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
Crina Grosan
BIB
2007
108views more  BIB 2007»
15 years 6 months ago
Bayesian methods in bioinformatics and computational systems biology
Bayesian methods are valuable, inter alia, whenever there is a need to extract information from data that is uncertain or subject to any kind of error or noise (including measurem...
Darren J. Wilkinson
ECCV
2006
Springer
16 years 8 months ago
Smooth Image Segmentation by Nonparametric Bayesian Inference
A nonparametric Bayesian model for histogram clustering is proposed to automatically determine the number of segments when Markov Random Field constraints enforce smooth class assi...
Peter Orbanz, Joachim M. Buhmann