840 search results - page 15 / 168 » The Complexity of the Extended GCD Problem |
TSP
2008
13 years 7 months ago
2008
Abstract-- This paper addresses the problem of tracking extended objects, such as ships or a convoy of vehicles moving in urban environment. Two Monte Carlo techniques for extended...
GD
1995
Springer
13 years 11 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
VLDB
1987
ACM
13 years 11 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
TSP
2008
13 years 7 months ago
2008
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...