Sciweavers

2163 search results - page 33 / 433
» cases 2004
Sort
View
ICPR
2004
IEEE
15 years 10 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
15 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
SC
2004
ACM
15 years 3 months ago
Modernizing Existing Software: A Case Study
In this paper, we discuss one of our experiments using the coordination language MANIFOLD to restructure an existing sequential numerical application into a concurrent application...
C. T. H. Everaars, Farhad Arbab, Barry Koren
ASIASIM
2004
Springer
15 years 3 months ago
Simulating Groundwater Transport Process Using a Vertical Heterogeneity Model: A Case Study
Abstract. It is important to simulate a groundwater transport process, e.g., pollutant migration, through the vadose zone and subsequent mixing within the saturated zone to assess ...
Samuel S. Lee, Hoh Peter In
ATAL
2004
Springer
15 years 3 months ago
A Case Study of Organizational Effects in a Distributed Sensor Network
We describe how a system employing different types of organizational techniques addresses the challenges posed by a large-scale distributed sensor network environment. The high-le...
Bryan Horling, Roger Mailler, Victor R. Lesser