Sciweavers

103 search results - page 7 / 21
» Hierarchical Design of Fast Minimum Disagreement Algorithms
Sort
View
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
14 years 8 months ago
Enhanced word clustering for hierarchical text classification
In this paper we propose a new information-theoretic divisive algorithm for word clustering applied to text classification. In previous work, such "distributional clustering&...
Inderjit S. Dhillon, Subramanyam Mallela, Rahul Ku...
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 1 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
INFOCOM
2006
IEEE
14 years 1 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
ADHOC
2007
122views more  ADHOC 2007»
13 years 7 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
TNN
2010
148views Management» more  TNN 2010»
13 years 2 months ago
A fast algorithm for robust mixtures in the presence of measurement errors
Abstract--In experimental and observational sciences, detecting atypical, peculiar data from large sets of measurements has the potential of highlighting candidates of interesting ...
Jianyong Sun, Ata Kabán