2434 search results - page 75 / 487 » Algorithmic Randomness of Closed Sets |
126
Voted
ICFCA
2009
Springer
15 years 10 months ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
114
Voted
ADVAI
2010
14 years 10 months ago
2010
The focus of warfare has shifted from the Industrial Age to the Information Age, as encapsulated by the term Network Enabled Capability. This emphasises information sharing, comma...
110
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
151
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
66
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...