7978 search results - page 115 / 1596 » Combining shared-coin algorithms |
133
Voted
ADC
2010
Springer
14 years 10 months ago
2010
Springer
Twig joins are key building blocks in current XML indexing systems, and numerous algorithms and useful data structures have been introduced. We give a structured, qualitative anal...
130
Voted
CP
2011
Springer
14 years 3 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
148
click to vote
ACIIDS
2012
IEEE
13 years 11 months ago
2012
IEEE
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
121
Voted
COLING
2010
14 years 10 months ago
2010
For sentiment analysis, lexicons play an important role in many related tasks. In this paper, aiming to build Chinese emotion lexicons for public use, we adopted a graph-based alg...
158
click to vote
SAC
2011
ACM
14 years 6 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...