Sciweavers

3122 search results - page 163 / 625
» A Theory of Network Equivalence
Sort
View
DCC
1995
IEEE
15 years 10 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
Dietmar Saupe
ICLP
2010
Springer
15 years 10 months ago
Inductive Logic Programming as Abductive Search
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
Domenico Corapi, Alessandra Russo, Emil Lupu
DOLAP
2005
ACM
15 years 8 months ago
Modeling, querying and reasoning about OLAP databases: a functional approach
We propose a new functional framework for modeling, querying and reasoning about OLAP databases. The framework represents data (data cubes and dimensional hierarchies) and queryin...
Ken Q. Pu
GRC
2008
IEEE
15 years 7 months ago
Fuzzy Preference Relation Rough Sets
Preference analysis is a class of important tasks in multi-criteria decision making. The classical rough set theory was generalized to deal with preference analysis by replacing e...
Qinghua Hu, Daren Yu, Congxin Wu
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
15 years 6 months ago
On the Number of t-Ary Trees with a Given Path Length
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
Gadiel Seroussi