Sciweavers

5022 search results - page 387 / 1005
» Data structures and problem solving using Java
Sort
View
IMC
2006
ACM
15 years 9 months ago
Semi-automated discovery of application session structure
While the problem of analyzing network traffic at the granularity of individual connections has seen considerable previous work and tool development, understanding traffic at a ...
Jayanthkumar Kannan, Jaeyeon Jung, Vern Paxson, Ca...
IPSN
2004
Springer
15 years 9 months ago
Loss inference in wireless sensor networks based on data aggregation
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...
Gregory Hartl, Baochun Li
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 8 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
JGS
2006
154views more  JGS 2006»
15 years 3 months ago
Area-to-point Kriging with inequality-type data
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...
E.-H. Yoo, Phaedon C. Kyriakidis
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 9 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna