18306 search results - page 367 / 3662 » Algorithmics in Exponential Time |
150
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n 2 n binary image. We show that the algorithm runs in O(log n...
232
click to vote
JCIT
2010
15 years 1 months ago
2010
Time plays important roles in Web search, because most Web pages contain time information and a lot of Web queries are time-related. However, traditional search engines such as Go...
180
click to vote
STACS
2005
Springer
16 years 11 days ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
188
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
192
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...