Sciweavers

1507 search results - page 98 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
JMLR
2002
74views more  JMLR 2002»
13 years 9 months ago
The Representational Power of Discrete Bayesian Networks
One of the most important fundamental properties of Bayesian networks is the representational power, reflecting what kind of functions they can or cannot represent. In this paper,...
Charles X. Ling, Huajie Zhang
TCS
1998
13 years 9 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
MOC
1998
107views more  MOC 1998»
13 years 9 months ago
A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
Suely Oliveira
ADBIS
2010
Springer
237views Database» more  ADBIS 2010»
13 years 11 months ago
Graph Object Oriented Database for Semantic Image Retrieval
This paper presents a new method for image retrieval using a graph object oriented database for processing the information extracted from the image through the segmentation process...
Eugen Ganea, Marius Brezovan
EUROMICRO
2006
IEEE
14 years 4 months ago
Visualization of Areas of Interest in Component-Based System Architectures
Understanding complex component-based systems often requires getting insight in how certain system properties, such as performance, trust, reliability, or structural attributes, c...
Heorhiy Byelas, Egor Bondarev, Alexandru Telea