Sciweavers

911 search results - page 58 / 183
» Kolmogorov Complexity Cores
Sort
View
IJAR
2006
125views more  IJAR 2006»
15 years 6 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»
15 years 6 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
TOG
2012
215views Communications» more  TOG 2012»
13 years 8 months ago
Dual loops meshing: quality quad layouts on manifolds
We present a theoretical framework and practical method for the automatic construction of simple, all-quadrilateral patch layouts on manifold surfaces. The resulting layouts are c...
Marcel Campen, David Bommes, Leif Kobbelt
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 6 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
FCCM
2005
IEEE
107views VLSI» more  FCCM 2005»
15 years 11 months ago
Simplifying the Integration of Processing Elements in Computing Systems Using a Programmable Controller
As technology sizes decrease and die area increases, designers are creating increasingly complex computing systems using FPGAs. To reduce design time for new products, the reuse o...
Lesley Shannon, Paul Chow