532 search results - page 52 / 107 » New Results on the Complexity of the Middle Bit of Multiplic... |
PC
2002
13 years 8 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
SIGMETRICS
2002
ACM
13 years 8 months ago
2002
ACM
The number and heterogeneity of requests to Web sites are increasing also because the Web technology is becoming the preferred interface for information systems. Many systems host...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
GEOINFO
2007
13 years 10 months ago
2007
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against...
HICSS
2005
IEEE
14 years 2 months ago
2005
IEEE
Over the past decades, large organisations have developed increasingly complex portfolios of information systems to support business processes. Maintenance and leveraging of these...