3874 search results - page 232 / 775 » Approximation Algorithms for k-hurdle Problems |
146
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
154
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
247
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
123
click to vote
OPODIS
2008
15 years 5 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
136
click to vote
EMNLP
2010
15 years 2 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...