141 search results - page 28 / 29 » Fast probabilistic snake algorithm |
SODA
2004
ACM
14 years 10 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
101
Voted
TSP
2010
14 years 4 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
There has been a significant increase in interest and participation in social networking websites recently. For many users, social networks are indispensable tools for sharing pe...
AAAI
2008
14 years 11 months ago
2008
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...