2957 search results - page 501 / 592 » The Complexity of Polynomial-Time Approximation |
SSD
1993
Springer
13 years 12 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
SIGGRAPH
1992
ACM
13 years 11 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
AOSD
2007
ACM
13 years 11 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
ECRIME
2007
13 years 11 months ago
2007
We estimate of the extent of phishing activity on the Internet via capture-recapture analysis of two major phishing site reports. Capture-recapture analysis is a population estima...
DAC
2010
ACM
13 years 11 months ago
2010
ACM
State-of-the-art automatic reliability analyses as used in system-level design approaches mainly rely on Binary Decision Diagrams (BDDs) and, thus, face two serious problems: (1) ...