1449 search results - page 208 / 290 » Self-Randomized Exponentiation Algorithms |
147
click to vote
GLOBECOM
2006
IEEE
16 years 7 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
174
click to vote
VTC
2006
IEEE
2006
IEEE
Distributed Stochastic Power and Rate Allocation for Energy Minimization in Wireless Sensor Networks
16 years 5 days ago
— In this paper, we propose a distributed stochastic algorithm for power and rate allocation in ad hoc wireless sensor networks. The problem we deal with is formulated as a trans...
156
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
348
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
182
click to vote
MCS
2005
Springer
15 years 11 months ago
2005
Springer
Mixed Group Ranks is a parametric method for combining rank based classi ers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...