2434 search results - page 49 / 487 » Algorithmic Randomness of Closed Sets |
113
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
115
click to vote
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association ...
104
click to vote
IJCNLP
2005
Springer
15 years 8 months ago
2005
Springer
Recent work on Conditional Random Fields (CRFs) has demonstrated the need for regularisation when applying these models to real-world NLP data sets. Conventional approaches to regu...
143
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
168
click to vote
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...