Results 11  20
of
1,088
Cell probe lower bounds and approximations for range mode
 In Proc. 37th International Colloquium on Automata, Languages, and Programming
, 2010
"... Abstract. The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] must return the mode of the subarray A[i], A[i + 1],..., A[j]. We prove that any data structure that uses log n l ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
return a label that occurs at least 1/c times that of the mode. We describe a linear space data structure that supports 3approximate range mode queries in constant time, and a data structure that uses O ( n ε in O(log 1) time.
Molecular dynamics simulations of biomolecules,”
 Nat Struct Biol,
, 2002
"... It has been 25 years since the first molecular dynamics simulation of a macromolecule of biological interest was published 1 . The simulation concerned the bovine pancreatic trypsin inhibitor (BPTI), which has served as the 'hydrogen molecule' of protein dynamics because of its small size ..."
Abstract

Cited by 143 (3 self)
 Add to MetaCart
. During the following 10 years, a wide range of motional phenomena were investigated by molecular dynamics simulations of proteins and nucleic acids. Most of these studies focused on the physical aspects of the internal motions and the interpretation of experiments. They include the analysis
Spacetime superresolution
 PAMI
, 2005
"... We propose a method for constructing a video sequence of high spacetime resolution by combining information from multiple lowresolution video sequences of the same dynamic scene. Superresolution is performed simultaneously in time and in space. By âtemporal superresolutionâ we mean recoverin ..."
Abstract

Cited by 65 (2 self)
 Add to MetaCart
We propose a method for constructing a video sequence of high spacetime resolution by combining information from multiple lowresolution video sequences of the same dynamic scene. Superresolution is performed simultaneously in time and in space. By âtemporal superresolutionâ we mean
Lower bounds for orthogonal range searching: I. the reporting case
 JOURNAL OF THE ACM
, 1990
"... We establish lower bounds on the complexity of orthogonal range reporting in the static case. Given a collection of n points in dspace and a box [a,, b,] x. x [ad, bd], report every point whose ith coordinate lies in [a,, biJ, for each i = 1,..., d. The collection of points is fixed once and for ..."
Abstract

Cited by 65 (4 self)
 Add to MetaCart
We establish lower bounds on the complexity of orthogonal range reporting in the static case. Given a collection of n points in dspace and a box [a,, b,] x. x [ad, bd], report every point whose ith coordinate lies in [a,, biJ, for each i = 1,..., d. The collection of points is fixed once
Better Space Bounds for Parameterized Range Majority and Minority
"... Abstract. Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks to preprocess a string of length n such that, given the endpoints of a range, one can quickly find all the distinct elements whose relative frequencies in that range are more than a threshold τ. ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
with optimal O(1/τ) query time. For the case when τ is given at query time, we significantly improve previous bounds, achieving either O(n lg lg σ) space and optimal O(1/τ) query time or compressed space and O ( (1/τ) lg lg(1/τ) query time. Along the lg lg n way, we consider the complementary problem
FS2: dynamic data replication in free disk space for improving disk performance and energy consumption
 In Proceedings of 20th ACM Symposium on Operating System Principles
, 2005
"... Disk performance is increasingly limited by its head positioning latencies, i.e., seek time and rotational delay. To reduce the head positioning latencies, we propose a novel technique that dynamically places copies of data in file system’s free blocks according to the disk access patterns observed ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
prototype, since the file system layout is modified only by using the free/unused disk space (hence the name Free Space File System, or FS 2), users are completely oblivious to how the file system layout is modified in the background; they will only notice performance improvements over time. For a wide
Improved bounds for Smallest Enclosing Disk Range Queries
"... Let S be a set of n points in the plane. We present a method where, using O(n log2 n) time and space, S can be preprocessed into a data structure such that given an axisparallel query rectangle q, we can report the radius of the smallest enclosing disk of the points lying in S ∩ q in O(log6 n) tim ..."
Abstract
 Add to MetaCart
Let S be a set of n points in the plane. We present a method where, using O(n log2 n) time and space, S can be preprocessed into a data structure such that given an axisparallel query rectangle q, we can report the radius of the smallest enclosing disk of the points lying in S ∩ q in O(log6 n
Networkaware operator placement for streamprocessing systems
 In ICDE
, 2006
"... To use their pool of resources efficiently, distributed streamprocessing systems push query operators to nodes within the network. Currently, these operators, ranging from simple filters to custom business logic, are placed manually at intermediate nodes along the transmission path to meet applicat ..."
Abstract

Cited by 143 (9 self)
 Add to MetaCart
decisions. We present an evaluation of the SBON approach through simulation, experiments on PlanetLab, and an integration with Borealis, an existing streamprocessing engine. Our results show that an SBON consistently improves network utilization, provides low stream latency, and enables dynamic
Dynamic Planar Range Maxima Queries
 In Proc. 38th International Colloquium on Automata, Languages, and Programming, vol 6755 of LNCS
"... Abstract. We consider the dynamic twodimensional maxima query problem. Let P be a set of n points in the plane. A point is maximal if it is not dominated by any other point in P. We describe two data structures that support the reporting of the t maximal points that dominate a given query point, an ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
case update time, using O(n log n) space, where t is the size of the output. This improves the worst case deletion time of the dynamic rectangular visibility query problem from O(log 3 n) to O(log 2 n). We adapt the data structure to the RAM model with word size w, where the coordinates of the points
Improving the Practical Space and Time Efficiency of the ShortestPaths Approach to SumofPairs Multiple Sequence Alignment
, 1996
"... The MSA program, written and distributed in 1989, is one of the few existing programs that attempts to find optimal alignments of multiple protein or DNA sequences. The MSA program implements a branchandbound technique together with a variant of Dijkstra's shortest paths algorithm to prune th ..."
Abstract

Cited by 75 (4 self)
 Add to MetaCart
the basic dynamic programming graph. We have made substantial improvements in the time and space usage of MSA. The improvements make feasible a variety of problem instances that were not feasible previously. On some runs we achieve an order of magnitude reduction in space usage and a significant
Results 11  20
of
1,088