Sciweavers

648 search results - page 68 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Blind channel shortening in OFDM system using nulltones and cyclic prefix
This paper considers the problem of blind channel shortening in OFDM systems. Standard OFDM systems use guard interval (GI) in form of cyclic prefix (CP) and nulltones (NT) redun...
Taoufik Ben Jabeur, Karim Abed-Meraim, Hatem Bouje...
IROS
2009
IEEE
150views Robotics» more  IROS 2009»
14 years 2 months ago
Learning locomotion over rough terrain using terrain templates
— We address the problem of foothold selection in robotic legged locomotion over very rough terrain. The difficulty of the problem we address here is comparable to that of human...
Mrinal Kalakrishnan, Jonas Buchli, Peter Pastor, S...
NIPS
2008
13 years 9 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson
INFOCOM
2007
IEEE
14 years 2 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 19 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...