2137 search results - page 352 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
96
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
122
click to vote
BIRD
2008
Springer
15 years 4 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
121
click to vote
ICGI
2010
Springer
15 years 13 days ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
142
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
165
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...