1389 search results - page 210 / 278 » Improved Approximation Algorithms for Label Cover Problems |
210
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
91
Voted
JEA
2006
15 years 2 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
128
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
HICSS
2003
IEEE
15 years 8 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
133
click to vote
PVLDB
2010
15 years 1 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...