Sciweavers

51 search results - page 4 / 11
» Trichotomy in the Complexity of Minimal Inference
Sort
View
AI
2006
Springer
13 years 10 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 8 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
BMCBI
2008
140views more  BMCBI 2008»
13 years 6 months ago
GORouter: an RDF model for providing semantic query and inference services for Gene Ontology and its associations
Background: The most renowned biological ontology, Gene Ontology (GO) is widely used for annotations of genes and gene products of different organisms. However, there are shortcom...
Qingwei Xu, Yixiang Shi, Qiang Lu, Guo-qing Zhang,...
CONEXT
2008
ACM
13 years 8 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
ICS
2010
Tsinghua U.
14 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz