697 search results - page 35 / 140 » Approximation of Information Granule Sets |
106
click to vote
ICDE
2009
IEEE
15 years 6 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
104
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
SPIRE
2005
Springer
15 years 5 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
101
click to vote
TCS
2010
14 years 10 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
110
click to vote
ECCC
2011
14 years 6 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...