Sciweavers

1071 search results - page 7 / 215
» Solving Geometric Constraint Systems
Sort
View
RTA
1997
Springer
14 years 20 days ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
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...
Ana Paula Tomás, Miguel Filgueiras
IMA
2009
Springer
111views Cryptology» more  IMA 2009»
14 years 3 months ago
Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
Sean Murphy, Maura B. Paterson
NSDI
2007
13 years 10 months ago
Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
Bernard Wong, Ivan Stoyanov, Emin Gün Sirer
CSCLP
2004
Springer
14 years 1 months ago
A System Prototype for Solving Multi-granularity Temporal CSP
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...
Claudio Bettini, Sergio Mascetti, Vincenzo Pupillo
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 1 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner