Sciweavers

2252 search results - page 104 / 451
» Improving Random Forests
Sort
View
VTC
2008
IEEE
14 years 2 months ago
Throughput Analysis of DS-CDMA Wireless Packet Access using Frequency-Domain Equalization and Random TPC
— Recently, we proposed a random transmit power control (TPC) to increase the uplink capacity of DS-CDMA wireless packet access using Rake combining. Furthermore, we evaluated th...
Haruki Ito, Eisuke Kudoh, ZhiSen Wang, Fumiyuki Ad...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
SIGIR
2005
ACM
14 years 1 months ago
A Markov random field model for term dependencies
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as eviden...
Donald Metzler, W. Bruce Croft
STACS
2004
Springer
14 years 1 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
COMPGEOM
1999
ACM
14 years 14 days ago
Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
Steven A. Wilmarth, Nancy M. Amato, Peter F. Still...