208 search results - page 35 / 42 » Improved upper bounds on the crossing number |
PODC
2005
ACM
14 years 28 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Higher order spatial features, such as doublets or
triplets have been used to incorporate spatial information
into the bag-of-local-features model. Due to computational
limits, ...
COCO
1998
Springer
13 years 11 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
ICALP
2005
Springer
14 years 27 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
SWAT
2004
Springer
14 years 22 days ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...