69 search results - page 1 / 14 » Solving Linear Diophantine Equations Using the Geometric Str... |
RTA
1997
Springer
13 years 8 months ago
1997
Springer
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
EPIA
1997
Springer
13 years 8 months ago
1997
Springer
Abstract. A new algorithm for finding the minimal solutions of systems of linear Diophantine equations has recently been published. In its description the emphasis was put on the ...
SIGMETRICS
2008
ACM
13 years 4 months ago
2008
ACM
Abstract-- An important intrinsic property of any structured Peer-to-Peer (P2P) overlay is multi-hop paths. Understanding their structure helps to solve challenging problems relate...
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
ICCV
2011
IEEE
12 years 4 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...