Sciweavers

1429 search results - page 111 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 10 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
FLAIRS
2004
13 years 10 months ago
Physical Approximations for Urban Fire Spread Simulations
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
Daniel J. Bertinshaw, Hans W. Guesgen
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 3 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
ICASSP
2011
IEEE
13 years 28 days ago
Design of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ï...
Xi Zhang
INFOCOM
1997
IEEE
14 years 1 months ago
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
Robert L. Carter, Mark Crovella