145 search results - page 28 / 29 » Discovery-driven graph summarization |
133
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
141
click to vote
CIVR
2007
Springer
15 years 8 months ago
2007
Springer
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
121
click to vote
SIGADA
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
TRECVID
2007
15 years 2 months ago
2007
Type Run Description MAP Official A UTen English ASR 0.0031 A UTt hs-t2-nm Top-2 concepts from t hs graph method with neighbor multiply 0.0137 A UTwiki-t2-nm Top-2 Wikipedia conc...
JAIR
2006
15 years 1 months ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...