73 search results - page 2 / 15 » Tree Decomposition with Function Filtering |
141
Voted
WEA
2010
Springer
15 years 9 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
132
click to vote
TSP
2008
15 years 2 months ago
2008
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
130
click to vote
CP
2010
Springer
15 years 5 days ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
97
Voted
IWOCA
2009
Springer
15 years 8 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
141
Voted
ML
2006
ACM
15 years 2 months ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...