Sciweavers

2168 search results - page 240 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ICML
2004
IEEE
16 years 7 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
GCC
2005
Springer
16 years 1 days ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
TCOM
2010
167views more  TCOM 2010»
15 years 4 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
ALT
2011
Springer
14 years 6 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
SOFSEM
2000
Springer
15 years 10 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt