2434 search results - page 91 / 487 » Algorithmic Randomness of Closed Sets |
170
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
147
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
112
Voted
AAAI
2000
15 years 4 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
278
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
130
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...