2137 search results - page 263 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
154
click to vote
ECIR
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we propose a model for exploiting community based usage information for video retrieval. Implicit usage information from a pool of past users could be a valuable sou...
161
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
181
click to vote
WEA
2007
Springer
16 years 12 days ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
171
click to vote
KSEM
2009
Springer
16 years 26 days ago
2009
Springer
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
180
click to vote
IJSI
2010
15 years 4 months ago
2010
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...