Sciweavers

8298 search results - page 147 / 1660
» On the Complexity of Numerical Analysis
Sort
View
ANTS
2006
Springer
127views Algorithms» more  ANTS 2006»
15 years 10 months ago
Doubly-Focused Enumeration of Pseudosquares and Pseudocubes
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
Kjell Wooding, Hugh C. Williams
OOPSLA
2005
Springer
15 years 12 months ago
Using dependency models to manage complex software architecture
An approach to managing the architecture of large software systems is presented. Dependencies are extracted from the code by a conventional static analysis, and shown in a tabular...
Neeraj Sangal, Ev Jordan, Vineet Sinha, Daniel Jac...
ECRTS
2005
IEEE
15 years 12 months ago
Fast and Tight Response-Times for Tasks with Offsets
In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits simi...
Jukka Mäki-Turja, Mikael Nolin
SIGIR
2006
ACM
16 years 9 days ago
A complex document information processing prototype
We developed a prototype for integrated retrieval and aggregation of diverse information contained in scanned paper documents. Such complex document information processing combine...
Shlomo Argamon, Gady Agam, Ophir Frieder, David A....
COMPGEOM
2009
ACM
15 years 11 months ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....