Sciweavers

531 search results - page 94 / 107
» A Better Algorithm for Random k-SAT
Sort
View
ITIIS
2010
247views more  ITIIS 2010»
13 years 2 months ago
An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing
In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic ...
Nadir Shah, Depei Qian
CORR
2011
Springer
193views Education» more  CORR 2011»
12 years 11 months ago
The Rate of Convergence of AdaBoost
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
Indraneel Mukherjee, Cynthia Rudin, Robert E. Scha...
CLEF
2008
Springer
13 years 9 months ago
UniNE at Domain-Specific IR - CLEF 2008
Our first objective in participating in this domain-specific evaluation campaign is to propose and evaluate various indexing and search strategies for the German, English and Russ...
Claire Fautsch, Ljiljana Dolamic, Jacques Savoy
TNN
2008
152views more  TNN 2008»
13 years 7 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
INFOCOM
2010
IEEE
13 years 6 months ago
Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
Praveen Kumar Muthuswamy, Koushik Kar, Sambit Sahu...