20294 search results - page 313 / 4059 » Algorithmic Information Theory |
186
click to vote
COSIT
2007
Springer
16 years 1 months ago
2007
Springer
Rough sets have been applied in spatial information theory to construct theories of granularity – presenting information at different levels of detail. Mathematical morphology c...
232
click to vote
IWOCA
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
197
click to vote
AVI
2006
15 years 8 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
240
click to vote
WWW
2009
ACM
16 years 8 months ago
2009
ACM
Giving suggestions to users of Web-based services is a common practice aimed at enhancing their navigation experience. Major Web Search Engines usually provide Suggestions under t...
243
click to vote
WWW
2011
ACM
15 years 2 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...