2434 search results - page 56 / 487 » Algorithmic Randomness of Closed Sets |
116
click to vote
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
116
click to vote
ICFCA
2007
Springer
15 years 9 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
131
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
129
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
106
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...