Sciweavers

218 search results - page 4 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Ying...
COLING
1992
13 years 8 months ago
Syntactic Ambiguity Resolution Using A Discrimination and Robustness Oriented Adaptive Learning Algorithm
In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of ins...
Tung-Hui Chiang, Yi-Chung Lin, Keh-Yih Su
CORR
2007
Springer
179views Education» more  CORR 2007»
13 years 7 months ago
On the Information Rate of MIMO Systems with Finite Rate Channel State Feedback and Power On/Off Strategy
— This paper quantifies the information rate of multiple-input multiple-output (MIMO) systems with finite rate channel state feedback and power on/off strategy. In power on/off...
Wei Dai, Youjian Liu, Brian Rider, Vincent K. N. L...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 2 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
13 years 7 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani