Sciweavers

701 search results - page 57 / 141
» Kolmogorov complexity in perspective
Sort
View
IJAR
2006
125views more  IJAR 2006»
13 years 7 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 7 months ago
The Google Similarity Distance
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
Rudi Cilibrasi, Paul M. B. Vitányi
ICANN
2009
Springer
14 years 2 months ago
Almost Random Projection Machine
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
Wlodzislaw Duch, Tomasz Maszczyk
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
14 years 1 months ago
Faster exploration of high level design alternatives using UML for better partitions
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
Waseem Ahmed, Doug Myers
WETICE
1996
IEEE
13 years 12 months ago
A constraint-based model of coordination in concurrent design projects
Communication and coordination play an important role in achieving concurrency in the design of large complex artifacts. It is also widely accepted that design is constraint orien...
Lokesh Gupta, John F. Chionglo, Mark S. Fox