Sciweavers

628 search results - page 115 / 126
» The minimum shift design problem
Sort
View
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
14 years 7 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
ICASSP
2011
IEEE
12 years 11 months ago
On single-channel noise reduction in the time domain
In this paper, we revisit the noise-reduction problem in the time domain and present a way to decompose the ltered speech into two uncorrelated (orthogonal) components: the desire...
Jingdong Chen, Jacob Benesty, Yiteng Huang, Tomas ...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
MOBIHOC
2008
ACM
14 years 7 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
MOBIHOC
2005
ACM
14 years 7 months ago
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
Jian Tang, Guoliang Xue, Weiyi Zhang