Sciweavers

336 search results - page 15 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 7 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
BMCBI
2008
163views more  BMCBI 2008»
13 years 7 months ago
Gene Ontology term overlap as a measure of gene functional similarity
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
Meeta Mistry, Paul Pavlidis
ICASSP
2007
IEEE
14 years 1 months ago
Context-Based Concept Fusion with Boosted Conditional Random Fields
The contextual relationships among different semantic concepts provide important information for automatic concept detection in images/videos. We propose a new context-based conce...
Wei Jiang, Shih-Fu Chang, Alexander C. Loui
TMC
2008
127views more  TMC 2008»
13 years 7 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
ATAL
2008
Springer
13 years 9 months ago
Multi-robot Markov random fields
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
Jesse Butterfield, Odest Chadwicke Jenkins, Brian ...