This presentation discusses increased demand for mobile broadband data, and evaluates cellular network performance of higher-order sectorization.
A Bloom filter is a randomized data structure for performing approximate membership queries.
When large XML documents published from a database are maintained externally, it is inefficient to repeatedly recompute them when the database is updated.
We present a method for selecting test sequences for concurrent programs from labeled transitions systems (LTS).
Fraud detection, customer retention, network monitoring and planning, and industrial process control all require tracking the behavior of hundreds, thousands or even millions of entities in real or
We study an incremental redundancy (IR) cooperative coding scheme for wireless networks.
In this paper, we provide a graph-based characterization of the set of indecomposable sequences that are useful in the computation of an upper bound to error probability of maximum-likelihood (ML)
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical scenarios, includi
An experimental procedure has been proposed recently which would allow quantitative separation of bulk and interfacial admittances from AC admittance spectra taken between electrodes on a coated tr
We describe simple, self-aligned, index guided arrays containing up to 10 ridge waveguide lasers.
