Sciweavers

2526 search results - page 232 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
ATAL
2006
Springer
15 years 8 months ago
Solving POMDPs using quadratically constrained linear programs
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
EUROPAR
2006
Springer
15 years 8 months ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
AAAI
2008
15 years 6 months ago
Semi-Supervised Ensemble Ranking
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance b...
Steven C. H. Hoi, Rong Jin
BCS
2008
15 years 5 months ago
Improved SIFT-Features Matching for Object Recognition
: The SIFT algorithm (Scale Invariant Feature Transform) proposed by Lowe [1] is an approach for extracting distinctive invariant features from images. It has been successfully app...
Faraj Alhwarin, Chao Wang, Danijela Ristic-Durrant...
MASCOTS
2010
15 years 5 months ago
Distributed Routing for Vehicular Ad Hoc Networks: Throughput-Delay Tradeoff
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
Ali Abedi, Majid Ghaderi, Carey L. Williamson