Sciweavers

56 search results - page 10 / 12
» Axiomatic First-Order Probability
Sort
View
NIPS
2008
13 years 7 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah
FOIS
2006
13 years 7 months ago
PR-OWL: A Framework for Probabilistic Ontologies
Abstract. Across a wide range of domains, there is an urgent need for a wellfounded approach to incorporating uncertain and incomplete knowledge into formal domain ontologies. Alth...
Paulo Cesar G. da Costa, Kathryn B. Laskey
TWC
2008
109views more  TWC 2008»
13 years 5 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang
BMCBI
2004
115views more  BMCBI 2004»
13 years 5 months ago
Quantifying the relationship between co-expression, co-regulation and gene function
Background: It is thought that genes with similar patterns of mRNA expression and genes with similar functions are likely to be regulated via the same mechanisms. It has been diff...
Dominic J. Allocco, Isaac S. Kohane, Atul J. Butte
JSYML
2010
107views more  JSYML 2010»
13 years 4 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov