253 search results - page 40 / 51 » Edge and Node Searching Problems on Trees |
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
101
click to vote
SIGIR
2011
ACM
14 years 16 days ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...