Sciweavers

3894 search results - page 656 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
INFOCOM
2010
IEEE
15 years 1 months ago
First-Fit Scheduling for Beaconing in Multihop Wireless Networks
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
Peng-Jun Wan, Zhu Wang, Hongwei Du, Scott C.-H. Hu...
SIAMCO
2010
128views more  SIAMCO 2010»
15 years 1 months ago
A Parallel Splitting Method for Coupled Monotone Inclusions
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions...
Hedy Attouch, Luis M. Briceño-Arias, Patric...
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 1 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
COLT
2010
Springer
15 years 1 months ago
Efficient Classification for Metric Data
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
Lee-Ad Gottlieb, Leonid Kontorovich, Robert Krauth...
PAKDD
2010
ACM
173views Data Mining» more  PAKDD 2010»
15 years 1 months ago
Distributed Knowledge Discovery with Non Linear Dimensionality Reduction
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
Panagis Magdalinos, Michalis Vazirgiannis, Dialect...