10608 search results - page 89 / 2122 » Complexity of O'Hara's Algorithm |
88
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
112
Voted
ICIP
2002
IEEE
16 years 2 months ago
2002
IEEE
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
114
Voted
VRST
2004
ACM
15 years 6 months ago
2004
ACM
In this paper we present an interactive collision detection algorithm for complex and deformable objects. For two target models, our approach rapidly calculates their region of in...
82
Voted
KDD
1998
ACM
15 years 4 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
139
click to vote
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...