760 search results - page 67 / 152 » Algorithms for finding clique-transversals of graphs |
145
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
156
click to vote
EWCBR
2004
Springer
15 years 10 months ago
2004
Springer
Textual case-based reasoning (TCBR) provides the ability to reason with domain-specific knowledge when experiences exist in text. Ideally, we would like to find an inexpensive way ...
145
click to vote
CLEF
2010
Springer
15 years 6 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
140
click to vote
AAAI
2004
15 years 6 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
225
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...