Sciweavers

104 search results - page 9 / 21
» Incomplete Tree Search using Adaptive Probing
Sort
View
IR
2010
13 years 6 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...
CISS
2008
IEEE
14 years 1 months ago
Compressed channel sensing
—Reliable wireless communications often requires accurate knowledge of the underlying multipath channel. This typically involves probing of the channel with a known training wave...
Waheed Uz Zaman Bajwa, Jarvis Haupt, Gil M. Raz, R...
JCIT
2007
111views more  JCIT 2007»
13 years 7 months ago
Edge Closing of Synthetic and Real Images using Polynomial Fitting
Usually, in image processing, edge detectors are mostly used as a basis for high level processing. In many cases, the edge detection gives erroneous and imprecise results, as inco...
M. Benjelloun, H. J. Tellez Oliva, R. Prevot
SASO
2007
IEEE
14 years 1 months ago
In Search of Simplicity: A Self-Organizing Group Communication Overlay
Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support ...
Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, A...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 2 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl