Sciweavers

1404 search results - page 63 / 281
» On General Laws of Complex Networks
Sort
View
AAAI
1993
15 years 1 months ago
Scientific Model-Building as Search in Matrix Spaces
Many reported discovery systems build discrete models of hidden structure, properties, or processes in the diverse fields of biology, chemistry, and physics. We show that the sear...
Raúl E. Valdés-Pérez, Jan M. ...
COMPUTE
2011
ACM
14 years 3 months ago
Similarity analysis of legal judgments
In this paper, we have made an effort to propose approaches to find similar legal judgements by extending the popular techniques used in information retrieval and search engines...
Sushanta Kumar, P. Krishna Reddy, V. Balakista Red...
IJCNN
2000
IEEE
15 years 4 months ago
VC Dimension Bounds for Product Unit Networks
A product unit is a formal neuron that multiplies its input values instead of summingthem. Furthermore, it has weights acting as exponents instead of being factors. We investigate...
Michael Schmitt
TIT
2011
131views more  TIT 2011»
14 years 6 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
15 years 5 months ago
Approximate Inference in Credal Networks by Variational Mean Field Methods
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman