2162 search results - page 288 / 433 » E-Crime Investigative Technologies |
144
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
189
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
157
click to vote
ICTIR
2009
Springer
16 years 1 months ago
2009
Springer
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
148
click to vote
ISCIS
2009
Springer
16 years 1 months ago
2009
Springer
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
214
click to vote
RR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can ...