2485 search results - page 299 / 497 » Time Bounded Frequency Computations |
FOCS
1999
IEEE
14 years 15 days ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
POPL
2002
ACM
14 years 8 months ago
2002
ACM
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
SSD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
WAW
2007
Springer
14 years 2 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
SC
1994
ACM
14 years 8 days ago
1994
ACM
The N - body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compu...