Now showing items 241-260 of 309

    • Optimal External Memory Interval Management 

      Arge, Lars; Vitter, Jeffrey Scott (Society for Industrial and Applied Mathematics, 2003)
      In this paper we present the external interval tree, an optimal external memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The external interval tree can be usedin an optimal ...
    • Application-Controlled Paging for a Shared Cache 

      Barve, Rakesh; Grove, Edward F.; Vitter, Jeffrey Scott (Society for Industrial and Applied Mathematics, 2000)
      We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to information about its own future page requests, ...
    • Optimal Prediction for Prefetching in the Worst Case 

      Krishnan, P.; Vitter, Jeffrey Scott (Society for Industrial and Applied Mathematics, 1998-12)
      Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because of their success in avoiding costly I/Os. ...
    • The Maximum Size of Dynamic Data Structures 

      Kenyon-Mathieu, Claire M.; Vitter, Jeffrey Scott (Society for Industrial and Applied Mathematics, 1991-10)
      This paper develops two probabilistic methods that allow the analysis of the maximum data structure size encountered during a sequence of insertions and deletions in data structures such as priority queues, dictionaries, ...
    • Parallel Transitive Closure and Point Location in Planar Structures 

      Tamassia, Roberto; Vitter, Jeffrey Scott (Society for Industrial and Applied Mathematics, 1991-08)
      Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and ...
    • Optimum Algorithms for a Model of Direct Chaining 

      Vitter, Jeffrey Scott; Chen, Wen-Chin (Society for Industrial and Applied Mathematics, 1985-05)
      Direct chaining is a popular and efficient class of hashing algorithms. In this paper we study optimum algorithms among direct chaining methods, under the restrictions that the records in the hash table are not moved after ...
    • Analysis of Early-Insertion Standard Coalesced Hashing 

      Chen, Wen-Chin; Vitter, Jeffrey Scott (Society for Industrial and Applied Mathematics, 1983)
      This paper analyzes the early-insertion standard coalesced hashing method (EISCH), which is a variant of the standard coalesced hashing algorithm (SCH) described in [Knu73], [Vit80] and [Vit82b]. The analysis answers the ...
    • I/O-efficient dynamic point location in monotone planar subdivisions 

      Agarwal, Pankaj K.; Arge, Lars; Brodal, Gerth Stølting; Vitter, Jeffrey Scott (Society for Industrial and Applied Mathematics, 1999)
      We present an efficient external-memory dynamic data structure for point location in monotone planar subdivisions. Our data structure uses O(N/B) disk blocks to store a monotone subdivision of size N, where B is the size ...
    • Scalable mining for classification rules in relational databases 

      Wang, Min; Iyer, Bala; Vitter, Jeffrey Scott (Institute of Mathematical Statistics, 2004)
      Data mining is a process of discovering useful patterns (knowledge) hidden in extremely large datasets. Classification is a fundamental data mining function, and some other functions can be reduced to it. In this paper ...
    • Image segmentation and analysis via multiscale gradient watershed hierarchies 

      Gauch, John M. (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1999-01)
      Multiscale image analysis has been used successfully in a number of applications to classify image features according to their relative scales. As a consequence, much has been learned about the scale-space behavior of ...
    • An FDTD/MoM hybrid technique for modeling complex antennas in the presence of heterogeneous grounds 

      Demarest, Kenneth R.; Plumb, Richard G.; Huang, Zhubo (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1999-11)
      Calculating the current distribution and radiation patterns for ground-penetrating radar antennas is a challenging problem because of the complex interaction between the antenna, the ground, and any buried scatterer. ...
    • Electromagnetic scattering from grassland Part II: Measurement and modeling results 

      Stiles, James Marion; Ulaby, Fawwaz T.; Sarabandi, Kamal (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2000-01)
      The validity of a coherent, grassland scattering model is determined by comparing the model predictions with direct measurements of a representative grass canopy, A wheat held was selected as the test target, and polarimetric, ...
    • Electromagnetic scattering from grassland Part I: A fully phase-coherent scattering model 

      Stiles, James Marion; Sarabandi, Kamal (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2000-01)
      A microwave scattering formulation is presented for grassland and other short vegetation canopies, The fact that the constituent elements of these targets can be as large as the vegetation layer make this formulation ...
    • Processing of multiple-receiver spaceborne arrays for wide-area SAR 

      Stiles, James Marion; Rajakrishna, Devindran; Lin, Sih Chung; Goodman, Nathan A. (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2002-04)
      The instantaneous area illuminated by a single-aperture synthetic aperture radar (SAR) is fundamentally limited by the minimum SAR antenna area constraint. This limitation is due to the fact that the number of illuminated ...
    • A group-theoretic analysis of symmetric target scattering with application to landmine detection 

      Stiles, James Marion; Beh, Beng; Apte, Abhjit V. (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2002-08)
      Landmines are generally constructed such that they posses a high level of geometric symmetry and are then buried in a manner that p reserves this symmetry. The scattered response of such a symmetric target will likewise ...
    • A matched-filter-based reverse-time migration algorithm for ground-penetrating radar data 

      Leuschen, Carl J.; Plumb, Richard G. (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2001-05)
      Ground-penetrating radar (GPR) is a remote sensing technique used to obtain information on subsurface features from data collected over the surface. The process of collecting data may be viewed as mapping from the object ...
    • The Rapidly Deployable Radio Network 

      Evans, Joseph B.; Minden, Gary J.; Shanmugan, K. S.; Prescott, Glenn Eugene; Frost, Victor S.; Ewy, Benjamin J.; Sanchez, Ricardo; Sparks, Craig; Malinimohan, K.; Roberts, James A.; Plumb, Richard G.; Petr, Dave (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 1999-04)
      The Rapidly Deployable Radio Network (RDRN) is an architecture and experimental system to develop and evaluate hardware and software components suitable for implementing mobile, rapidly deployable, and adaptive wireless ...
    • Resolution and synthetic aperture characterization of sparse radar arrays 

      Stiles, James Marion; Goodman, Nathan A. (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2003-07)
      The concept of radar satellite constellations, or clusters, for synthetic aperture radar (SAR), moving target indicator (MTI), and other radar modes has been proposed and is currently under research. These constellations ...
    • Detectability models for multiple access low-probability-of-intercept networks 

      Prescott, Glenn Eugene; Mills, Robert F. (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2000-07)
      Increased demands for communications in the tactical battlefield have driven the development of multiple access low-probability-of-intercept (LPT) networks. Most detectability studies of LPI networks focus on the individual ...
    • Multistatic adaptive pulse compression 

      Blunt, Shannon David; Gerlach, Karl (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2006-07)
      A new technique denoted as multistatic adaptive pulse compression (MAPC) is introduced which exploits recent work on adaptive pulse compression (APC) in order to jointly separate and pulse compress the concurrently received ...