3244 search results - page 307 / 649 » On convex complexity measures |
193
click to vote
DOLAP
2006
ACM
15 years 10 months ago
2006
ACM
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...
140
click to vote
APAL
2010
15 years 6 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
183
click to vote
KAIS
2006
15 years 6 months ago
2006
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
183
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
169
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...