239 search results - page 41 / 48 » Hardness and Algorithms for Rainbow Connectivity |
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
86
Voted
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
IPM
2007
14 years 9 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
AI
2000
Springer
14 years 9 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
104
click to vote
SIAMCOMP
2011
14 years 4 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...